Skip to main content
SpringerLink
Log in

Continuous Approaches for Solving Discrete Optimization Problems

  • Chapter
Book cover Handbook on Modelling for Discrete Optimization

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 88))

Abstract

This chapter contains short expository notes on applying continuous approaches for solving discrete optimization problems. We discuss some general aspects of the connection between integer programming and continuous optimization problems, along with several specific examples. The considered problems include maximum clique, satisfiability, the Steiner tree problem, minimax and semidefinite programming.

This work was partially supported by grants from NSF, NIH, CRDF and AirForce.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Abello, S. Butenko, P.M. Pardalos, and M.G.C. Resende, Finding independent sets in a graph using continuous multivariable polynomial formulations, Journal of Global Optimization 21/4 (2001), pp. 111–137.

    Article  MathSciNet  Google Scholar 

  2. F. Alizadeh, Optimization Over Positive Semi-Definite Cone: Interrior-Point Methods and Combinatorial Optimization, in: P.M. Pardalos, ed., Advances in Optimization and Parallel Computing, North-Holland, 1992, pp. 1–25.

    Google Scholar 

  3. F. Alizadeh, Interrior-Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization, SIAM J. Opt. Vol. 5 (1995), pp. 13–51.

    Article  MATH  MathSciNet  Google Scholar 

  4. S.J. Benson, Y. Ye, X. Zhang, Solving large-scale semidefinite programs for combinatorial optimization, SIAM J. Optim. Vol. 10/2 (2000) pp. 443–461.

    Article  MathSciNet  Google Scholar 

  5. I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo, The maximum clique problem, in: D.-Z. Du and P.M. Pardalos, eds., Handbook of Combinatorial Optimization (Supplement Volume A), Kluwer Academic (1999), 1–74.

    Google Scholar 

  6. S. Burer, R.D.C. Monteiro, and Y. Zhang, Maximum stable set formulations and heuristics based on continuous optimization, Mathematical Programming 94:1 (2002) 137–166.

    Article  MATH  MathSciNet  Google Scholar 

  7. S. Busygin, A new trust region technique for the maximum weight clique problem, Combinatorial Optimization 2002, Paris, France, 2002. Submitted to CO02 Special Issue of Discrete Applied Mathematics. Available at http://www.busygin.dp.ua/npc.html.

    Google Scholar 

  8. S. Busygin, S. Butenko, P.M. Pardalos, A Heuristic for the Maximum Indepepndent Set Problem Based on Optimization of a Quadratic Over a Sphere, Journal of Combinatorial Optimization Vol. 6, pp. 287–297, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  9. S. Busygin and D. Pasechnik, On \( \bar \chi \left( G \right) - \alpha \left( G \right) > 0 \) gap recognition and α(G)-upper bounds, ECCC Report TR03-052 (2003).

    Google Scholar 

  10. F. Cao, D.-Z. Du, B. Gao, P.-J. Wan, P.M. Pardalos, Minimax Problems in Combinatorial Optimization, in: D.-Z. Du, P.M. Pardalos, eds., Minimax and Applications, Kluwer Academic Publishers, 1995, pp. 269–292.

    Google Scholar 

  11. X. Cheng, Y. Li, D.-Z. Du, H.Q. Ngo, Steiner Trees in Industry, in: D.-Z. Du, P.M. Pardalos, eds., Handbook of Combinatorial Optimization, Suppl. Vol. B, pp. 193–216, 2005.

    Google Scholar 

  12. S. Cook. The complexity of theorem-proving procedures, in: Proc. 3rd Ann. ACM Symp. on Theory of Computing, Association for Computing Machinery, pp. 151158, 1971.

    Google Scholar 

  13. R.W. Cottle, J.S. Pang, R.E. Stone, The Linear complementaruty problem. Academic Press (1992).

    Google Scholar 

  14. M. Davis, H. Putnam, A computing procedure for quantification theory, Journal of ACM, 7, pp. 201–215, 1960.

    Article  MATH  MathSciNet  Google Scholar 

  15. D.-Z. Du, J. Gu, P.M. Pardalos, eds., Satisfiability Problem: Theory and Applications, DIMACS Series Vol. 35, American Mathematical Society (1998).

    Google Scholar 

  16. D.-Z. Du, P.M. Pardalos, eds., Minimax and Applications, Kluwer Academic Publishers, 1995.

    Google Scholar 

  17. D.-Z. Du, P.M. Pardalos, Global Minimax Approaches for Solving Discrete Problems, Lecture Notes in Economics and Mathematical Systems, vol. 452, Springer-Verlag (1997), pp. 34–48.

    MATH  MathSciNet  Google Scholar 

  18. D.Z. Du and F.K. Hwang, An approach for proving lower bounds: solution of Gilbert-Pollak’s conjecon Steiner ratio, Proceedings 31th FOCS (1990), pp. 76–85.

    Google Scholar 

  19. D.Z. Du and P.M. Pardalos, A continuous version of a result of Du and Hwang, Journal of Global Optimization 4 (1994), 127–129.

    Article  MathSciNet  Google Scholar 

  20. Improved approximation algorithms for max k-cut and max bisection, Proc. 4th IPCO Conference, pp. 1–13, 1995.

    Google Scholar 

  21. M. Garey and D. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM J. Appl. Math. 32, pp. 826–834, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  22. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman & Co., 1979).

    Google Scholar 

  23. F. Giannesi and F. Niccolucci, Connections between nonlinear and integer programming problem, in: Symposia Mathematica Vol XIX, Instituto Nazionale di Alta Mathematica, Acad. Press. N.Y., pp. 161–176, 1976.

    Google Scholar 

  24. L.E. Gibbons, D.W. Hearn, P.M. Pardalos, and M.V. Ramana, A Continuous based heuristyic for the maximum clique problem, in: D.S. Johnson and M.A. Trick, eds., Cliques, Coloring and Satisfiability: Second DI-MACS Implementation Challenge, DIMACS Series, American Math Society, Vol. 26, pp. 103–124, 1996.

    Google Scholar 

  25. L.E. Gibbons, D.W. Hearn, P.M. Pardalos, and M.V. Ramana, Continuous characterizations of the maximum clique problem, Math. Oper. Res. 22 (1997) 754–768.

    Article  MATH  MathSciNet  Google Scholar 

  26. E.N. Gilbert, H.O. Pollak, Steiner minimal trees, SIAM J. Appl. Math, 16 (1968), pp. 1–29.

    Article  MATH  MathSciNet  Google Scholar 

  27. M.X. Goemans, Semidefinite programming in combinatorial optimization, Math. Programming 79 (1997), pp. 143–162.

    Article  MATH  MathSciNet  Google Scholar 

  28. M.X. Goemans, D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. MAch. 42/6 (1995), pp. 1115–1145.

    MathSciNet  Google Scholar 

  29. J. Gu, Optimization algorithms for the satisfiability (SAT) problem, in: D.-Z. Du and J. Sun, eds., Advances in Optimization and Approximation, Nonconvex Optimization and its Applications, Vol. 1, Kluwer Academic Publishers, pp.72–154, 1994.

    Google Scholar 

  30. J. Gu, Global optimization Satisfiability (SAT) Problem, IEEE Trans. on Knowledge and data Engineering, Vol. 6, No. 3, pp. 361–381, 1994.

    Article  Google Scholar 

  31. J. Gu, Parallel Algorithms for Satisfiability (SAT) Problem, in: P.M. Pardalos et al., eds., Parallel Processing on Discrete Optimization Problems, DIMACS Series, American Math. SOciety, Vol. 22, pp. 105–161, 1995.

    Google Scholar 

  32. J. Gu, P.W. Purdom, J. Franko, B. W. Wah, Algorithms for the Satisfiability (SAT) Problem: A Survey, in: D.-Z. Du, J. Gu, P.M. Pardalos, eds., Satisfiability Problem: Theory and Applications, DIMACS Series Vol. 35, American Mathematical Society (1998), pp. 19–151.

    Google Scholar 

  33. D. Guesfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, 1997.

    Google Scholar 

  34. J. Harant, Some news about the independence number of a graph, Discussiones Mathematicae Graph Theory, Vol. 20, pp. 7179, 2000.

    MathSciNet  Google Scholar 

  35. J. Harant, A. Pruchnewski, and M. Voigt, On dominating sets and independent sets of graphs, Combinatorics, Probability and Computing, Vol. 8, pp. 547553, 1999.

    Article  MathSciNet  Google Scholar 

  36. J. Håstad, Clique is hard to approximate within n 1−ε, in: Proc. 37th Annual IEEE Symposium on the Foundations of Computer Science (FOCS) (1996) 627–636.

    Google Scholar 

  37. R. Horst, P.M. Pardalos (Editors), Handbook of Global Optimization. Nonconvex Optimization and its Applications Vol. 2, Kluwer Academic Publishers, 1995.

    Google Scholar 

  38. R. Horst, P.M. Pardalos, and N.V. Thoai, Introduction to Global Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 2nd edition, 2000.

    MATH  Google Scholar 

  39. F.K. Hwang, D.S. Richards, P. Winter, Steiner Tree Problems, North-Holland, Amsterdam, 1992.

    Google Scholar 

  40. A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan, M.G.C. Resende, Computational experience with an interrior point algorithm on the Satisfiability problem, Annals of Operations Research 25 (1990), pp. 43–58.

    Article  MATH  MathSciNet  Google Scholar 

  41. A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan, M.G.C. Resende, A continuous approach to inductive inference, Mathematical Programming 57 (1992), pp. 215–238.

    Article  MATH  MathSciNet  Google Scholar 

  42. S. Khot, Improved inapproximability results for maxclique, chromatic number and approximate graph coloring, in: Proc. 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS) (2001) 600–609.

    Google Scholar 

  43. B. Khoury, P.M. Pardalos, D. Hearn, Equivalent formulations of the Steiner tree problem in graphs, in: D.-Z. Du, P.M. Pardalos, eds., Network Optimization Problems, pp. 53–62, 1993.

    Google Scholar 

  44. D.E. Knuth, The sandwich theorem, Elec. J. Comb. 1 (1994).

    Google Scholar 

  45. M. Kojima, N. Megiddo, T. Noma, A. Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Springer-Verlag, Lecture Notes in Computer Sciences 538 (1991).

    Google Scholar 

  46. M. Kojima, L. Tunçel, Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems, Journal of Global Optimization Vol 24 (2002), pp. 333–348.

    Article  MATH  Google Scholar 

  47. L. Lovaász, A. Schrjiver, Cones of matrices and set functions and 0–1 optimization, SIAM J. Opt. 1, pp. 166–190, 1991.

    Google Scholar 

  48. C. Maranas, C. Floudas, P.M. Pardalos, New results in the packing of equal circles in a square, Discrete Mathematics 142, pp. 287–293, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  49. J.E. Mitchell, P.M. Pardalos, M.G.C. Resende, Interior Point Methods for Combinatorial Optimization, in: D.-Z Du and P. Pardalos, eds., Handbook of Combinatorial Optimization Vol. 1 (1998), pp. 189–298.

    Google Scholar 

  50. T.S. Motzkin and E.G. Straus, Maxima for graphs and a new proof of a theorem of Turan, Canadian Journal of Mathematics 17:4 (1965) 533–540.

    MATH  MathSciNet  Google Scholar 

  51. K.G. Murty, Linear complementarity, linear and nonlinear programming. Heldermann Verlag, Berlin (1988).

    MATH  Google Scholar 

  52. Yu.E. Nesterov, Semidefinite relaxation and nonconvex quadratic optimization, Optimization Methods and Software Vol.9 (1998) pp. 141–160.

    MATH  MathSciNet  Google Scholar 

  53. P.M. Pardalos, The Linear Complemementarity Problem, in: S. Gomez and J.P. Hennart, eds., Advances in Optimization and Numerical Analysis, Kluwer Academinc Publishers (1994), pp. 39–49.

    Google Scholar 

  54. P.M. Pardalos, Continuous Approaches to Discrete Optimization Problems, in: G. Di Pillo and F. Giannessi, eds., Nonlinear Optimization and Applications, Plenum Publishing (1996), pp. 313–328.

    Google Scholar 

  55. P.M. Pardalos, J.B. Rosen, Global optimization approach to the linear complementarity problem, SIAM J. Scient. Stat. Computing Vol. 9, No. 2 (1988), pp. 341–353.

    Article  MATH  MathSciNet  Google Scholar 

  56. P.M. Pardalos, H. Wolkowicz, Topics on Semidefinite and Interrior-Point Methods, American Math. Society, 1998.

    Google Scholar 

  57. M.V. Ramana, P.M. Pardalos, Semidefinite Programming, in: T. Terlaky, ed., Interrior Point Methods of Mathematical Programming, Kluwer Academic Publishers, 1996, pp. 369–398.

    Google Scholar 

  58. F. Rendl, Semidefinite programming and combinatorial optimization, Appl. Numer. Math. 29 (1999), pp. 255–281.

    Article  MATH  MathSciNet  Google Scholar 

  59. B. Ricceri, S. Simons, eds., Minimax Theory and Applications, Kluwer Academic Publishers, 1998.

    Google Scholar 

  60. N.Z. Shor, Dual quadratic estimates in polynomial and Boolean programming, Annals of Operations Research 25 (1990), pp. 163–168.

    Article  MATH  MathSciNet  Google Scholar 

  61. N.Z. Shor and P.I. Stetsyuk, Lagrangian bounds in multiextremal polynomial and discrete optimization problems, Journal of Global Optimization 23(2002), pp. 1–41.

    Article  MATH  MathSciNet  Google Scholar 

  62. L. Vandenberhe and S. Boyd, Semidefinite Programming, SIAM Review, 38 (1996), pp. 49–95.

    Article  MathSciNet  Google Scholar 

  63. H. Wolkowicz, Semidefinite Programming, in: P.M. Pardalos, M.G.C. Resende, eds., Handbook of Applied Optimization, Oxford University Press, 2002, pp. 40–50.

    Google Scholar 

  64. H. Wolkowicz, Semidefinite and Cone Programming Bibliography/Comments, Available at http://orion.math.uwaterloo.ca/hwolkowi/henry/software/sdpbibliog.pdf, 2005.

    Google Scholar 

  65. B.Y. Wu, K.-M. Chao, Spanning Trees and Optimization Problems, Chapman & Hall/CRC, 2004.

    Google Scholar 

  66. Y. Ye, A.699-approximation algorithm for Max-Bisection, Math. Programming 90 (2001), pp. 101–111.

    Article  MATH  Google Scholar 

  67. Y. Ye, Approximating quadratic programming with bound and quadratic constraints, Mathematical Programming, 84(2):219–226, 1999.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, FL, 32611, USA

    Panos M Pardalos, Oleg A Prokopyev & Stanislav Busygin

Authors
  1. Panos M Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oleg A Prokopyev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stanislav Busygin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Operational Research Department, London School of Economics, UK

    Gautam Appa  & H. Paul Williams  & 

  2. Department of Mathematical and Physical Sciences, Aristotle University of Thessaloniki, Greece

    Leonidas Pitsoulis

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Pardalos, P.M., Prokopyev, O.A., Busygin, S. (2006). Continuous Approaches for Solving Discrete Optimization Problems. In: Appa, G., Pitsoulis, L., Williams, H.P. (eds) Handbook on Modelling for Discrete Optimization. International Series in Operations Research & Management Science, vol 88. Springer, Boston, MA. https://doi.org/10.1007/0-387-32942-0_2

Download citation

Publish with us

Policies and ethics

Search

Navigation