دانلود کتاب Bonn Workshop on Combinatorial Optimization

فهرست مطالب :

Content:
General editor
Page ii

Edited by
Page iii

Copyright page
Page iv

Preface
Page v
Achim Bachem, Martin Grötschel, Bernhard Korte

List of Participants
Pages viii-ix

Parity Graphs Original Research Article
Pages 1-26
M. Burlet, J.P. Uhry

The Travelling Salesman Polytope and {0, 2}-Matchings Original Research Article
Pages 27-55
Gérard Cornuéjols, William Pulleyblank

Polyhedra for Composed Independence Systems Original Research Article
Pages 57-67
William H. Cunningham

Augmenting Paths and a Class of Independence Systems Original Research Article
Pages 69-82
Reinhardt Euler

Transformations which Preserve Perfectness and H-Perfectness of Graphs Original Research Article
Pages 83-95
J. Fonlupt, J.P. Uhry

An Algorithm for Submodular Functions on Graphs Original Research Article
Pages 97-120
András Frank

Optimal Subtrees and Extensions Original Research Article
Pages 121-127
H. Gröflin, Th.M. Liebling, A. Prodon

Cycles Through Prescribed and Forbidden Point Sets Original Research Article
Pages 129-147
D.A. Holton, M.D. Plummer

An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs Original Research Article
Pages 149-168
Yoshiro Ikura, George L. Nemhauser

Degree-two Inequalities, Clique Facets, and Biperfect Graphs Original Research Article
Pages 169-187
Ellis L. Johnson, Manfred W. Padberg

Flow Network Formulations of Polymatroid Optimization Problems Original Research Article
Pages 189-200
E.L. Lawler, C.U. Martel

Two Lines Least Squares Original Research Article
Pages 201-211
A.K. Lenstra, J.K. Lenstra, A.H.G. Rinnooy Kan, T.J. Wansbeek

Bounding the Independence Number of a Graph Original Research Article
Pages 213-223
L. Lovász

Scheduling Problems with a Singular Solution Original Research Article
Pages 225-239
Rolf H. Möhring

Ear Decompositions of Elementary Graphs and GF₂-rank of Perfect Matchings Original Research Article
Pages 241-260
Denis J. Naddef, William R. Pulleyblank

Min-max Relations for Directed Graphs Original Research Article
Pages 261-280
A. Schrijver

The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars Original Research Article
Pages 281-286
Maciej M. Sysło, Jerzy Żak

Minimization of Some Nonlinear Functions over Polymatroidal Network Flows Original Research Article
Pages 287-309
U. Zimmermann