The minimum distance superset problem: formulations and algorithms
暂无分享,去创建一个
[1] Noisy data make the partial digest problem , 2022 .
[2] Alain Billionnet,et al. Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem , 2007, Math. Program..
[3] Steven Skiena,et al. Reconstructing sets from interpoint distances (extended abstract) , 1990, SCG '90.
[4] Arvind Gupta,et al. On the turnpike problem , 2000 .
[5] A. L. Patterson. Ambiguities in the X-Ray Analysis of Crystal Structures , 1944 .
[6] Paolo Penna,et al. Partial Digest is hard to solve for erroneous input data , 2005, Theor. Comput. Sci..
[7] Maurice Nivat,et al. The chords' problem , 2002, Theor. Comput. Sci..
[8] Zheng Zhang. An Exponential Example for a Partial Digest Mapping Algorithm , 1994, J. Comput. Biol..
[9] A. L. Patterson. A Direct Method for the Determination of the Components of Interatomic Distances in Crystals , 1935 .
[10] Paolo Penna,et al. Noisy Data Make the Partial Digest Problem NP-hard , 2003, WABI.
[11] Maurice Nivat,et al. Some necessary clarifications about the chords' problem and the Partial Digest Problem , 2005, Theor. Comput. Sci..
[12] Steven Skiena,et al. A partial digest approach to restriction site mapping , 1993, ISMB.
[13] Warren D. Smith,et al. Reconstructing Sets From Interpoint Distances , 2003 .
[14] Warren P. Adams,et al. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .
[15] Kurt M. Anstreicher,et al. Institute for Mathematical Physics Semidefinite Programming versus the Reformulation–linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming Semidefinite Programming versus the Reformulation-linearization Technique for Nonconvex Quadratically Constrained , 2022 .
[16] D. Wolfe,et al. Nonparametric Statistical Methods. , 1974 .