| 1995 | (0, ±1) Ideal Matrices. Paolo Nobili, Antonio Sassano |
| 1995 | A Characterization of Seymour Graphs. Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti |
| 1995 | A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. Hiroshi Nagamochi, Toshihide Ibaraki |
| 1995 | A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems. Laureano F. Escudero, Silvano Martello, Paolo Toth |
| 1995 | A Mickey-Mouse Decomposition Theorem. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic |
| 1995 | A Minimal Algorithm for the Bounded Knapsack Problem. David Pisinger |
| 1995 | Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan |
| 1995 | Combining Semidefinite and Polyhedral Relaxations for Integer Programs. Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz |
| 1995 | Combining and Strengthening Gomory Cuts. Sebastián Ceria, Gérard Cornuéjols, Milind Dawande |
| 1995 | Computational Study of a Family of Mixed-Integer Quadratic Programming Problems. Daniel Bienstock |
| 1995 | Coverings and Delta-Coverings. André Bouchet |
| 1995 | Distributed Near-Optimal Matching. Xiaotie Deng |
| 1995 | Embedding Graphs in the Torus in Linear Time. Martin Juvan, Joze Marincek, Bojan Mohar |
| 1995 | Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times. Han Hoogeveen, Steef L. van de Velde |
| 1995 | GRIN: An Implementation of Gröbner Bases for Integer Programming. Serkan Hosten, Bernd Sturmfels |
| 1995 | Generalized Max Flows and Augmenting Paths. David Hartvigsen |
| 1995 | How to Make a Strongly Connected Digraph Two-Connected. András Frank, Tibor Jordán |
| 1995 | Improved Approximation Algorithms for MAX Alan M. Frieze, Mark Jerrum |
| 1995 | Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings Egon Balas, Jens Clausen |
| 1995 | Minimum Cost Dynamic Flows: The Series-Parallel Case. Bettina Klinz, Gerhard J. Woeginger |
| 1995 | Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems. Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra |
| 1995 | On Combinatorial Properties of Binary Spaces. Beth Novick, András Sebö |
| 1995 | On Implementing Push-Relabel Method for the Maximum Flow Problem. Boris V. Cherkassky, Andrew V. Goldberg |
| 1995 | Oriented Matroid Polytopes and Polyhedral Fans are Signable. Peter Kleinschmidt, Shmuel Onn |
| 1995 | Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs. Harold N. Gabow, K. S. Manu |
| 1995 | Polyhedra and Optimization in Connection with a Weak Majorization Ordering. Geir Dahl |
| 1995 | Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. Yves Crama, Frits C. R. Spieksma |
| 1995 | Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. Maurice Queyranne, Andreas S. Schulz |
| 1995 | Separating Clique Tree and Bipartition Inequalities in Polynominal Time. Robert D. Carr |
| 1995 | Separation Problems for the Stable Set Polytope. Eddie Cheng, William H. Cunningham |
| 1995 | Sequence Independent Lifting of Cover Inequalities. Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh |
| 1995 | The Hilbert Basis of the Cut Cone over the Complete Graph François Laburthe |
| 1995 | The Interval Order Polytope of a Digraph. Rudolf Müller, Andreas S. Schulz |
| 1995 | The Markov Chain of Colourings. J. Eric Bartels, Dominic Welsh |
| 1995 | The Random Linear Bottleneck Assignment Problem. Ulrich Pferschy |
| 1995 | The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case. Imre Bárány, Herbert E. Scarf, David Shallcross |
| 1995 | Use of Hidden Network Structure in the Set Partitioning Problem. Agha Iqbal Ali, Hyun-Soo Han, Jeffery L. Kennington |