Skip to main content
SpringerLink
Log in
Book cover
  • Book
  • © 1980

Combinatorial Optimization I

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)

Sections

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

Table of contents (14 chapters)

  1. Front Matter

    PDF

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

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

  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

  12. Balanced matrices and property (G)

    • Claude Berge
    Pages 163-175

  13. Dual integrality in b-matching problems

    • W. Pulleyblank
    Pages 176-196

  16. Back Matter

    PDF
Back to top

Keywords

Back to top

Bibliographic Information

  • Book Title: Combinatorial Optimization I

  • Editors: M. W. Padberg

  • Series Title: Mathematical Programming Studies

  • DOI: https://doi.org/10.1007/BFb0120883

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1980

  • eBook ISBN: 978-3-642-00802-3Published: 07 March 2009

  • Series ISSN: 0303-3929

  • Series E-ISSN: 2364-8201

  • Edition Number: 1

  • Number of Pages: 222

  • Topics: Optimization, Mathematics of Computing

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Search

Navigation