Integer programming: facets, subadditivity, and duality for group and semi-group problems
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Johnson, Ellis L. 1938- (VerfasserIn)
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 1980
Schriftenreihe:CBMS-NSF regional conference series in applied mathematics 32
Schlagworte:
Online-Zugang:TUM01
UBW01
UBY01
UER01
Volltext
Beschreibung:Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader
Includes bibliographical references
Integer programming -- Cuts, knapsacks, and a cyclic group problem -- Finite Abelian groups -- Gomory's corner polyhedra -- Blocking polyhedra and master group problems -- Araoz's semigroup problem -- Blockers and polars for master semigroup problems -- Subadditive and minimal valid inequalities -- Subadditive characterizations -- Duality
This monograph considers pure integer programming problems which concern packing, partitioning or covering. For this class of problems, an algorithmic framework using a duality approach is offered. Furthermore, the author proposes for the first time a general framework for both packing and covering problems characterizing the convex whole of integer solutions
Beschreibung:1 Online Resource (vii, 68 Seiten)
ISBN:0898711622
9780898711622
DOI:10.1137/1.9781611970371

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen