Min-Max Results in Combinatorial Optimization

A. Schrijver
Additional contact information
A. Schrijver: Universiteit van Amsterdam, Instituut voor Actuariaat en Econometrie

A chapter in Mathematical Programming The State of the Art, 1983, pp 439-500 from Springer

Abstract: Abstract Often the optimum of a combinatorial optimization problem is characterized by a min-max relation, asserting that the maximum value in one combinatorial optimization problem is equal to the minimum value in some other optimization problem. One of the best-known examples is the max-flow min-cut theorem of Ford and Fulkerson [1956] and Elias, Feinstein and Shannon [1956]:

Keywords: Bipartite Graph; Undirected Graph; Submodular Function; Perfect Graph; Incidence Vector (search for similar items in EconPapers)
Date: 1983
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-642-68874-4_18

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

DOI: 10.1007/978-3-642-68874-4_18

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