Details

Autor(en) / Beteiligte

• Bachem, A
• Grotschel, Martin
• Korte, B. H

Titel

Bonn Workshop on Combinatorial Optimization

Beschreibungen/Notizen

• "Based on lectures presented at the IV. Bonn Workshop on Combinatorial Optimazation, August 28-30, 1980."
• Includes bibliographical references.
• Chapter 7. Cycles through prescribed and forbidden point setsChapter 8. An efficient primal simplex algorithm for maximum weighted vertex packing on bipartite graphs; Chapter 9. Degree-two inequalities, clique facets, and biperfect graphs; Chapter 10. Flow network formulations of polymatroid optimization problems; Chapter 11. Two lines least squares; Chapter 12. Bounding the independence number of a graph; Chapter 13. Scheduling problems with a singular solution; Chapter 14. Ear decompositions of elementary graphs and GF2-rank of perfect matchings
• Chapter 15. Min-max relations for directed graphsChapter 16. The bandwidth problem: critical subgraphs and the solution for caterpillars; Chapter 17. Minimization of some nonlinear functions over polymatroidal network flows
• Bonn Workshop on Combinatorial Optimization
• English