Article ID: | iaor1993639 |
Country: | Netherlands |
Volume: | 39 |
Issue: | 1 |
Start Page Number: | 37 |
End Page Number: | 56 |
Publication Date: | Aug 1992 |
Journal: | Discrete Applied Mathematics |
Authors: | Rardin Ronald L., Sudit Moises |
Keywords: | combinatorial analysis |
Almost all successful exact approaches to hard combinatorial optimization problems are firmly rooted in the theory of a single canonical model formate-linear integer programming. Some heuristic or approximate strategies for hard combinatorial problems are also structures around linear programming, but many of the most effective, including greedy and local search schemes have no close ties to the linear format. This paper introduces a new structure the authors call