Continuous Approaches to Discrete Optimization Problems

@inproceedings{Pardalos1996ContinuousAT,
  title={Continuous Approaches to Discrete Optimization Problems},
  author={Panos M. Pardalos},
  year={1996}
}
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. 

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 23 CITATIONS

Approximating the maximum weight clique using replicator dynamics

  • IEEE Trans. Neural Netw. Learning Syst.
  • 2000
VIEW 12 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Annealed replication: a new heuristic for the maximum clique problem

VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

An optimized link scheduling technique for mobile ad hoc networks using directional antennas

  • MILCOM 2015 - 2015 IEEE Military Communications Conference
  • 2015
VIEW 2 EXCERPTS
CITES BACKGROUND