Abstract
Combinatorial optimization problems possess a discrete special structure, such that it is very difficult to develop general purpose test problems, as well as general purpose software for solving them. For the exact solution of these problems, usually an equivalent integer programming formulation is provided to an IP solver, that uses branch and bound to solve it. For a suboptimal solution, many heuristic procedures have been refined over the years, and there exist procedures designed to provide suboptimal solutions to general combinatorial optimization problems, given that the problem has been put into some prespecified format.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Floudas, C.A. et al. (1999). Combinatorial Optimization Problems. In: Handbook of Test Problems in Local and Global Optimization. Nonconvex Optimization and Its Applications, vol 33. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3040-1_13
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3040-1_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4812-0
Online ISBN: 978-1-4757-3040-1
eBook Packages: Springer Book Archive