Amazon cover image
Image from Amazon.com

Studies on graphs and discrete programming / editor, P. Hansen.

Contributor(s): Series: Annals of discrete mathematics ; 11. | North-Holland mathematics studies ; 59.©1981Description: 1 online resource (viii, 395 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780444862167
  • 0444862161
  • 9780080871707
  • 0080871704
  • 1281797332
  • 9781281797339
Report number: 81014027Subject(s): Genre/Form: Additional physical formats: Print version:: Studies on graphs and discrete programming.LOC classification:
  • T57.74 .S78 1981eb
Online resources:
Contents:
Front Cover; Studies on Graphs and Discrete Programming; Copyright Page; Foreword; Contents; Chapter 1. Integer and fractional matchings; Chapter 2. Packing problems; Chapter 3. Admissible transformations and their application to matching problems; Chapter 4. Polynomial algorithms for totally dual integral systems and extensions; Chapter 5. Minimal costreliability ratio spanning tree; Chapter 6. A graph theoretic analysis of bounds for the quadratic assignment problem; Chapter 7. An investigation of algorithms used in the restructuring of linear programming basis matrices prior to inversion.
Action note:
  • digitized 2011 HathiTrust Digital Library committed to preserve
Summary: Studies on Graphs and Discrete Programming.
Item type: eBooks
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Includes proceedings of the Workshop on Applications of Graph Theory to Management, held at the European Institute for Advanced Studies in Management, Brussels, Mar. 20-21, 1979, and also papers from the 10th Mathematical Programming Symposium, Montreal, Aug. 27-31, 1979.

Includes bibliographical references.

Print version record.

Front Cover; Studies on Graphs and Discrete Programming; Copyright Page; Foreword; Contents; Chapter 1. Integer and fractional matchings; Chapter 2. Packing problems; Chapter 3. Admissible transformations and their application to matching problems; Chapter 4. Polynomial algorithms for totally dual integral systems and extensions; Chapter 5. Minimal costreliability ratio spanning tree; Chapter 6. A graph theoretic analysis of bounds for the quadratic assignment problem; Chapter 7. An investigation of algorithms used in the restructuring of linear programming basis matrices prior to inversion.

Use copy Restrictions unspecified star MiAaHDL

Studies on Graphs and Discrete Programming.

Electronic reproduction. [S.l.] : HathiTrust Digital Library, 2011. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2011 HathiTrust Digital Library committed to preserve pda MiAaHDL

Elsevier ScienceDirect All Books

Copyright © 2020 Alfaisal University Library. All Rights Reserved.
Tel: +966 11 2158948 Fax: +966 11 2157910 Email:
librarian@alfaisal.edu