Skip to main content
SpringerLink
Log in

Combinatorial Optimization I

  • Book
  • © 1980

Overview

Editors:
  1. M. W. Padberg
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Mathematical Programming Studies (MATHPROGRAMM, volume 12)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (14 chapters)

  1. Front Matter

    Download chapter PDF

  2. Weakly admissible transformations for solving algebraic assignment and transportation problems

    • R. E. Burkard, U. Zimmermann
    Pages 1-18

  3. Cutting planes from conditional bounds: A new approach to set covering

    • Egon Balas
    Pages 19-36

  4. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

    • Egon Balas, Andrew Ho
    Pages 37-60

  5. On the symmetric travelling salesman problem: Solution of a 120-city problem

    • Martin Grötschel
    Pages 61-77

  6. On the symmetric travelling salesman problem: A computational study

    • Manfred W. Padberg, Saman Hong
    Pages 78-107

  7. A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation

    • T. H. C. Smith
    Pages 108-114

  8. Polynomial bounding for NP-hard problems

    • P. M. Camerini, F. Maffioli
    Pages 115-119

  9. Worst case analysis of greedy type algorithms for independence systems

    • D. Hausmann, B. Korte, T. A. Jenkyns
    Pages 120-131

  10. Quadratic knapsack problems

    • G. Gallo, P. L. Hammer, B. Simeone
    Pages 132-149

  11. Fractional vertices, cuts and facets of the simple plant location problem

    • Monique Guignard
    Pages 150-162

  12. Balanced matrices and property (G)

    • Claude Berge
    Pages 163-175

  13. Dual integrality in b-matching problems

    • W. Pulleyblank
    Pages 176-196

  14. A technique for determining blocking and anti-blocking polyhedral descriptions

    • H.-C. Huang, L. E. Trotter
    Pages 197-205

  15. Certain kinds of polar sets and their relation to mathematical programming

    • Jørgen Tind
    Pages 206-213

  16. Back Matter

    Download chapter PDF
Back to top

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation