Research Trends in Combinatorial Optimization
Edited by William Cook (),
László Lovász () and
Jens Vygen ()
in Springer Books from Springer
Keywords: 90CXX (search for similar items in EconPapers)
Date: 2009
ISBN: 978-3-540-76796-1
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Chapters in this book:
- Ch 1 On the Location and p-Median Polytopes
- Mourad Baïou and Francisco Barahona
- Ch 2 Facet Generating Techniques
- Sylvia Boyd and William R. Pulleyblank
- Ch 3 Antimatroids, Betweenness, Convexity
- Vašek Chvátal
- Ch 4 Euler Complexes
- Jack Edmonds
- Ch 5 Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid
- Jean Fonlupt and Alexandre Skoda
- Ch 6 A Survey on Covering Supermodular Functions
- András Frank and Tamás Király
- Ch 7 Theory of Principal Partitions Revisited
- Satoru Fujishige
- Ch 8 Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach
- Frank Göring, Jochen Harant, Dieter Rautenbach and Ingo Schiermeyer
- Ch 9 Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
- Stefan Hougardy
- Ch 10 The Unbounded Knapsack Problem
- T. C. Hu, Leo Landa and Man-Tak Shing
- Ch 11 Recent Developments in Discrete Convex Analysis
- Kazuo Murota
- Ch 12 Multiflow Feasibility: An Annotated Tableau
- Guyslain Naves and András Sebő
- Ch 13 Many Facets of Dualities
- Jaroslav Nešetřil
- Ch 14 On the Structure of Graphs Vertex Critical with Respect to Connected Domination
- Michael D. Plummer
- Ch 15 LS-LIB: A Library of Tools for Solving Production Planning Problems
- Yves Pochet, Mathieu Van Vyve and Laurence A. Wolsey
- Ch 16 From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis
- Lionel Pournin and Thomas M. Liebling
- Ch 17 Graphic Submodular Function Minimization: A Graphic Approach and Applications
- Myriam Preissmann and András Sebő
- Ch 18 Matroids—the Engineers’ Revenge
- András Recski
- Ch 19 On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming
- Andreas S. Schulz
- Ch 20 Single-Sink Multicommodity Flow with Side Constraints
- F. Bruce Shepherd
- Ch 21 An Introduction to Network Flows over Time
- Martin Skutella
- Ch 22 Edge-Connectivity Augmentations of Graphs and Hypergraphs
- Zoltán Szigeti
- Ch 23 Some Problems on Approximate Counting in Graphs and Matroids
- Dominic Welsh
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:sprbok:978-3-540-76796-1
Ordering information: This item can be ordered from
http://www.springer.com/9783540767961
DOI: 10.1007/978-3-540-76796-1
Access Statistics for this book
More books in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().