4. IPCO 1995: Copenhagen, Denmark

Session 1

• Alan M. Frieze, Mark Jerrum:
  Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. 1-13
  
• Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan:
  Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. 14-28
  
• Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra:
  Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems. 29-39
  

Session 2

• Robert D. Carr:
  Separating Clique Tree and Bipartition Inequalities in Polynominal Time. 40-49
  
• Rudolf Müller, Andreas S. Schulz:
  The Interval Order Polytope of a Digraph. 50-64
  
• Eddie Cheng, William H. Cunningham:
  Separation Problems for the Stable Set Polytope. 65-79
  

Session 3

• Daniel Bienstock:
  Computational Study of a Family of Mixed-Integer Quadratic Programming Problems. 80-94
  
• David Pisinger:
  A Minimal Algorithm for the Bounded Knapsack Problem. 95-109
  
• Laureano F. Escudero, Silvano Martello, Paolo Toth:
  A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems. 110-123
  

Session 4

• Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz:
  Combining Semidefinite and Polyhedral Relaxations for Integer Programs. 124-134
  
• Xiaotie Deng:
  Distributed Near-Optimal Matching. 135-144
  
• Ulrich Pferschy:
  The Random Linear Bottleneck Assignment Problem. 145-156
  

Session 5

• Boris V. Cherkassky, Andrew V. Goldberg:
  On Implementing Push-Relabel Method for the Maximum Flow Problem. 157-171
  
• Agha Iqbal Ali, Hyun-Soo Han, Jeffery L. Kennington:
  Use of Hidden Network Structure in the Set Partitioning Problem. 172-184
  
• David Hartvigsen:
  Generalized Max Flows and Augmenting Paths. 185-197
  

Session 6

• Peter Kleinschmidt, Shmuel Onn:
  Oriented Matroid Polytopes and Polyhedral Fans are Signable. 198-211
  
• Beth Novick, András Sebö:
  On Combinatorial Properties of Binary Spaces. 212-227
  
• André Bouchet:
  Coverings and Delta-Coverings. 228-243
  

Session 7

• Imre Bárány, Herbert E. Scarf, David Shallcross:
  The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case. 244-251
  
• François Laburthe:
  The Hilbert Basis of the Cut Cone over the Complete Graph K₆. 252-266
  
• Serkan Hosten, Bernd Sturmfels:
  GRIN: An Implementation of Gröbner Bases for Integer Programming. 267-276
  

Session 8

• Yves Crama, Frits C. R. Spieksma:
  Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. 277-291
  
• Han Hoogeveen, Steef L. van de Velde:
  Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times. 292-306
  
• Maurice Queyranne, Andreas S. Schulz:
  Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. 307-320
  

Session 9

• Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
  A Mickey-Mouse Decomposition Theorem. 321-328
  
• Bettina Klinz, Gerhard J. Woeginger:
  Minimum Cost Dynamic Flows: The Series-Parallel Case. 329-343
  
• Paolo Nobili, Antonio Sassano:
  (0, ±1) Ideal Matrices. 344-359
  

Session 10

• Martin Juvan, Joze Marincek, Bojan Mohar:
  Embedding Graphs in the Torus in Linear Time. 360-363
  
• Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti:
  A Characterization of Seymour Graphs. 364-372
  
• J. Eric Bartels, Dominic Welsh:
  The Markov Chain of Colourings. 373-387
  

Session 11

• Harold N. Gabow, K. S. Manu:
  Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs. 388-402
  
• Hiroshi Nagamochi, Toshihide Ibaraki:
  A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. 403-413
  
• András Frank, Tibor Jordán:
  How to Make a Strongly Connected Digraph Two-Connected. 414-425
  

Session 12

• Geir Dahl:
  Polyhedra and Optimization in Connection with a Weak Majorization Ordering. 426-437
  
• Sebastián Ceria, Gérard Cornuéjols, Milind Dawande:
  Combining and Strengthening Gomory Cuts. 438-451
  
• Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
  Sequence Independent Lifting of Cover Inequalities. 452-461