Fifty-Plus Years of Combinatorial Integer Programming

William Cook ()
Additional contact information
William Cook: Georgia Institute of Technology, School of Industrial and Systems Engineering

Chapter Chapter 12 in 50 Years of Integer Programming 1958-2008, 2010, pp 387-430 from Springer

Abstract: Abstract Throughout the history of integer programming, the field has been guided by research into solution approaches to combinatorial problems. We discuss some of the highlights and defining moments of this area.

Keywords: Integer Programming; Travel Salesman Problem; Travel Salesman Problem; Rand Corporation; Perfect Graph (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

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:sprchp:978-3-540-68279-0_12

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

DOI: 10.1007/978-3-540-68279-0_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().