6. IPCO 1998:
Houston, Texas, USA
Integer Programming Applications
Integer Programming Computation
: Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time.
Dorit S. Hochbaum
: The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem.
R. N. Uma
, Joel Wein
: On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems.
Quadratic Assignment Problems
: Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations.