Continuous Approaches to Discrete Optimization Problems

This paper contains expository notes about continuous approaches to several discrete optimization problems. There are many ways to formulate discrete problems as equivalent continuous problems or to embed the discrete feasible domain in a larger continuous space (relaxation). The surprising variety of continuous approaches reveal interesting theoretical properties which can be explored to develop new algorithms for computing (sub)optimal solutions to discrete optimization problems.

[1]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[2]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[3]  Panos M. Pardalos,et al.  Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[4]  P. Pardalos.  Complexity in numerical optimization , 1993 .

[5]  Panos M. Pardalos,et al.  Continuous Characterizations of the Maximum Clique Problem , 1997, Math. Oper. Res..

[6]  Panos M. Pardalos,et al.  Equivalent Formulations for the Steiner Problem in Graphs , 1993 .

[7]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .

[8]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9]  Katta G. Murty,et al.  Mathematical programming: State of the art 1994 , 1994 .

[10]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.

[11]  Ding-Zhu Du,et al.  An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[12]  Jun Gu,et al.  Optimization Algorithms for the Satisfiability (SAT) Problem , 1994 .

[13]  Naum Z. Shor,et al.  Dual estimates in multiextremal problems , 1992, J. Glob. Optim..

[14]  Panos M. Pardalos,et al.  8 Integer programming , 1993, Computational Statistics.

[15]  D. Du,et al.  Advances in optimization and approximation , 1994 .

[16]  Jun Gu,et al.  Global Optimization for Satisfiability (SAT) Problem , 1994, IEEE Trans. Knowl. Data Eng..

[17]  Susana Gomez,et al.  Advances in Optimization and Numerical Analysis , 1994 .

[18]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[19]  B. Mohar,et al.  Eigenvalues in Combinatorial Optimization , 1993 .

[20]  Panos M. Pardalos,et al.  Quadratic Assignment and Related Problems , 1994 .

[21]  Panos M. Pardalos,et al.  A continuous based heuristic for the maximum clique problem , 1993, Cliques, Coloring, and Satisfiability.

[22]  Donald E. Knuth.  The Sandwich Theorem , 1994, Electron. J. Comb..

[23]  Jun Gu.  Parallel Algorithms for Satisfiability (SAT) Problem , 1994, Parallel Processing of Discrete Optimization Problems.

[24]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[25]  Panos M. Pardalos.  The Linear Complementarity Problem , 1994 .

[26]  Panos M. Pardalos,et al.  Advances in Optimization and Parallel Computing , 1992 .

[27]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[28]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[29]  G. Nemhauser,et al.  Integer Programming , 2020 .

[30]  Panos M. Pardalos,et al.  New results in the packing of equal circles in a square , 1995, Discret. Math..