On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming

Andreas S. Schulz ()
Additional contact information
Andreas S. Schulz: Massachusetts Institute of Technology

Chapter 19 in Research Trends in Combinatorial Optimization, 2009, pp 399-428 from Springer

Abstract: Summary An integral part of combinatorial optimization and computational complexity consists of establishing relationships between different problems or different versions of the same problem. In this chapter, we bring together known and new, previously published and unpublished results, which establish that 15 problems related to optimizing a linear function over a 0/1-polytope are polynomial-time equivalent. This list of problems includes optimization and augmentation, testing optimality and primal separation, sensitivity analysis and inverse optimization, as well as several others.

Date: 2009
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-76796-1_19

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

DOI: 10.1007/978-3-540-76796-1_19

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