Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization II

  • Book
  • © 1980

Overview

Editors:
  1. V. J. Rayward-Smith
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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. Perfect triangle-free 2-matchings

    • Gérard Cornuejols, William R. Pulleyblank
    Pages 1-7

  3. On the structure of all minimum cuts in a network and applications

    • Jean-Claude Picard, Maurice Queyranne
    Pages 8-16

  4. Clutter percolation and random graphs

    • Colin McDiarmid
    Pages 17-25

  5. The use of recurrence relations in computing

    • L. B. Wilson
    Pages 26-34

  6. A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem

    • C. S. Edwards
    Pages 35-52

  7. A problem of scheduling conference accommodation

    • A. I. Hinxman
    Pages 53-57

  8. Constructing timetables for sport competitions

    • J. A. M. Schreuder
    Pages 58-67

  9. The reconstruction of latin squares with applications to school timetabling and to experimental design

    • A. J. W. Hilton
    Pages 68-77

  10. An algorithm for the single machine sequencing problem with precedence constraints

    • C. N. Potts
    Pages 78-87

  11. Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory

    • Jens Clausen, Lone Aalekjær Hansen
    Pages 88-101

  12. The distance between nodes for a class of recursive trees

    • J. S. Clowes
    Pages 102-110

  13. Optimization problems arising from the incorporation of split values in search trees

    • V. J. Rayward-Smith
    Pages 111-120

  14. Heuristic analysis, linear programming and branch and bound

    • Laurence A. Wolsey
    Pages 121-134

  15. Heuristic improvement methods: How should starting solutions be chosen?

    • C. J. Pursglove, T. B. Boffey
    Pages 135-142
Back to top

Keywords

Bibliographic Information

  • Book Title: Combinatorial Optimization II

  • Editors: V. J. Rayward-Smith

  • Series Title: Mathematical Programming Studies

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

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1980

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

  • Series ISSN: 0303-3929

  • Series E-ISSN: 2364-8201

  • Edition Number: 1

  • Number of Pages: 142

  • Topics: Optimization, Mathematics of Computing

Publish with us

Policies and ethics

Back to top

Search

Navigation