7. IPCO 1999: Graz, Austria

• Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink:
  Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. 1-16
  
• Alexander A. Ageev, Maxim Sviridenko:
  Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. 17-30
  
• Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin:
  Solving the Convex Cost Integer Dual Network Flow Problem. 31-44
  
• Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.:
  Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. 45-59
  
• Alper Atamtürk, George L. Nemhauser, Martin W. P. Savelsbergh:
  Valid Inequalities for Problems with Additive Variable Upper Bounds. 60-72
  
• Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
  A Min-Max Theorem on Feedback Vertex Sets. 73-86
  
• Alberto Caprara, Matteo Fischetti, Adam N. Letchford:
  On the Separation of Maximally Violated mod-k Cuts. 87-98
  
• Fabián A. Chudak, David P. Williamson:
  Improved Approximation Algorithms for Capacitated Facility Location Problems. 99-113
  
• William H. Cunningham, Lawrence Tang:
  Optimal 3-Terminal Cuts and Linear Programming. 114-125
  
• Dragos Cvetkovic, Mirjana Cangalovic, Vera Kovacevic-Vujcic:
  Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem. 126-136
  
• Friedrich Eisenbrand, Andreas S. Schulz:
  Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. 137-150
  
• Lisa Fleischer:
  Universally Maximum Flow with Piecewise-Constant Capacities. 151-165
  
• Jean Fonlupt, Ali Ridha Mahjoub:
  Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope. 166-182
  
• András Frank, Tibor Jordán, Zoltán Szigeti:
  An Orientation Theorem with Parity Conditions. 183-190
  
• András Frank, Zoltán Király:
  Parity Constrained k-Edge-Connected Orientations. 191-201
  
• Eran Halperin, Uri Zwick:
  Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs. 202-217
  
• Mark E. Hartmann, Maurice Queyranne, Yaoguang Wang:
  On the Chvátal Rank of Certain Inequalities. 218-233
  
• David Hartvigsen:
  The Square-Free 2-Factor Problem in Bipartite Graphs. 234-241
  
• Christoph Helmberg:
  The m-Cost ATSP. 242-258
  
• Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
  A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. 259-272
  
• Tibor Jordán:
  Edge-Splitting Problems with Demands. 273-288
  
• Kenji Kashiwabara, Masataka Nakamura, Takashi Takabatake:
  Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors. 289-303
  
• Gunnar W. Klau, Petra Mutzel:
  Optimal Compaction of Orthogonal Grid Drawings. 304-319
  
• Philip N. Klein, Neal E. Young:
  On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. 320-327
  
• Stavros G. Kolliopoulos, Clifford Stein:
  Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. 328-344
  
• Vardges Melkonian, Éva Tardos:
  Approximation Algorithms for a Directed Network Design Problem. 345-360
  
• Petra Mutzel, René Weiskircher:
  Optimizing over All Combinatorial Embeddings of a Planar Graph. 361-376
  
• Hiroshi Nagamochi, Toshihide Ibaraki:
  A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. 377-390
  
• John Noga, Steven S. Seiden:
  Scheduling Two Machines with Release Times. 391-399
  
• András Sebö:
  An Introduction to Empty Lattice Simplices. 400-414
  
• Zoltán Szigeti:
  On Optimal Ear-Decompositions of Graphs. 415-428
  
• Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan:
  Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. 429-438
  
• Eduardo Uchoa, Marcus Poggi de Aragão:
  Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut. 439-452