Continuous Approaches for Solving Discrete Optimization Problems

Panos M Pardalos (), Oleg A Prokopyev () and Stanislav Busygin ()
Additional contact information
Panos M Pardalos: University of Florida
Oleg A Prokopyev: University of Florida
Stanislav Busygin: University of Florida

Chapter Chapter 2 in Handbook on Modelling for Discrete Optimization, 2006, pp 39-60 from Springer

Abstract: 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.

Keywords: Discrete optimization; global optimization; non-convex optimization; semidefinite programming; linear complementarity problem; max clique; satisfiability; minimax theory; Steiner problem (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations: View citations in EconPapers (10)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-0-387-32942-0_2

Ordering information: This item can be ordered from
http://www.springer.com/9780387329420

DOI: 10.1007/0-387-32942-0_2

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().