Interior Point Methods for Combinatorial Optimization

John E. Mitchell (), Panos M. Pardalos () and Mauricio G. C. Resende ()
Additional contact information
John E. Mitchell: Renssaeler Polytechnic Institute, Mathematical Sciences
Panos M. Pardalos: University of Florida, Center for Applied Optimization, ISE Department
Mauricio G. C. Resende: AT&T Labs Research, Information Sciences Research

A chapter in Handbook of Combinatorial Optimization, 1998, pp 189-297 from Springer

Abstract: Abstract Interior-point methods, originally invented in the context of linear programming, have found a much broader range of applications, including discrete problems that arise in computer science and operations research as well as continuous computational problems arising in the natural sciences and engineering. This chapter describes the conceptual basis and applications of interior-point methods for discrete problems in computing.

Keywords: Interior Point; Interior Point Method; Linear Programming Relaxation; Integer Programming Problem; Quadratic Assignment Problem (search for similar items in EconPapers)
Date: 1998
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-1-4613-0303-9_4

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

DOI: 10.1007/978-1-4613-0303-9_4

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 ().