0/1-integer programming: Optimization and augmentation are equivalent

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 979, Issue , 1995, Pages 473-483

  Schulz, Andreas S ^a   Weismantel, Robert ^b   Ziegler, Günter M ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; POLYNOMIAL APPROXIMATION;

0/1 INTEGER PROGRAMMING; COMBINATORIAL OPTIMIZATION PROBLEMS; FOLLOWING PROBLEM; LINEAR OBJECTIVE FUNCTIONS; STRONGLY POLYNOMIAL TIME;

INTEGER PROGRAMMING;

EID: 84947744343     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60313-1_164     Document Type: Conference Paper

References (9)

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin: Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs N J, 1993.
2. Jack Edmonds and Richard M. Karp: Theoretical improvements in algorithmic efficiency for network flow problems, Journal of the Association for Computing Machinery 19 (1972), 248-264.
3. Andrs Frank and Eva Tardos: An application of simultaneous Diophantine approximation in combinatorial optimization, Combinatorica 7 (1987), 49-65.
4. Harold N. Gabow: Scaling algorithms for network problems, Journal of Computer and System Sciences 31 (1985), 148-168.
5. Martin Grötschel and László Lovász: Combinatorial Optimization, Chapter 28 of the Handbook on Combinatorics, R. Graham, M. Grötschel, and L. Lovász (eds.), to appear.
6. Martin Grötschel, László Lovász, and, Alexander Schrijver: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics 2, Springer, Berlin, 1988; Second edition 1993.
7. László Lovász. An Algorithmic Theory of Numbers, Graphs and Convexity, CBMS-NSF Regional Conference Series in Applied Mathematics 50, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1986.
8. Hans Röck: Scaling techniques for minimal cost network flows, in: V. Page (ed.), Discrete Structures and Algorithms, Carl Hanser, Munich, 1980, pp. 181-191.
9. Alexander Schrijver: Theory of Linear and Integer Programming, John Wiley &: Sons, Chichester, 1986.