1. IPCO 1990:
Waterloo,
Ontorio,
Canada
Ravi Kannan, William R. Pulleyblank (Eds.):
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, Waterloo, Ontorio, Canada, May 28-30 1990.
University of Waterloo Press 1990, ISBN 0-88898-099-X 
- Alexander A. Ageev, Vladimir L. Beresnev:
Polynomially Solvable Cases of the Simple Plant Location Problem.
1-6
- Edward J. Anderson, Michael C. Ferris:
A Genetic Algorithm for the Assembly Line Balancing Problem.
7-18
- Norbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer:
On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem.
19-28
- Franz Aurenhammer, Johann Hagauer, Wilfried Imrich:
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge.
29-44
- Egon Balas:
Finding Out Whether a Valid Inequality is Facet Defining.
45-59
- Daniel Bienstock:
Some Provably Hard Crossing Number Problems.
61-83
- E. Andrew Boyd:
Polyhedral Results for the Precedence-Constrained Knapsack Problem.
85-100
- Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
Modular Arithmetic and Randomization for Exact Matroid Problems.
101-113
- Chung-Kuan Cheng, T. C. Hu:
Ancestor Tree for Arbitrary Multi-Terminal Cut Functions.
115-127
- Sunil Chopra, Giovanni Rinaldi:
The Graphical Asymmetric Traveling Salesman Polyhedron.
129-145
- Michele Conforti, Gérard Cornuéjols:
A Decomposition Theorem for Balanced Matrices.
147-169
- Michel Deza, Monique Laurent:
New Results on Facets of the Cut Cone.
171-184
- E. A. Dinic:
The Fastest Algorithm for the Pert Problem with AND-and OR-Nodes (The New-Product-New-Technology Problem).
185-187
- Martin E. Dyer, Alan M. Frieze:
Probabilistic Analysis of the Generalised Assignment Problem.
189-200
- Jean Fonlupt, András Sebö:
On the Clique-Rank and the Coloration of Perfect Graphs.
201-216
- András Frank:
Conservative Weightings and Ear-Decompositions of Graphs.
217-229
- A. A. Fridman, Eugene Levner:
A Survey of Some Results in Discrete Optimisation.
231-235
- Scott W. Hadley, Franz Rendl, Henry Wolkowicz:
Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques.
237-248
- Leslie A. Hall, David B. Shmoys:
Near-Optimal Sequencing with Precedence Constraints.
249-260
- Dorit S. Hochbaum:
On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions.
261-273
- Winfried Hochstättler:
Shellability of Oriented Matroids.
275-281
- J. A. Hoogeveen:
Minimizing Maximum Earliness and Maximum Lateness on a Single Machine.
283-295
- Wen-Lian Hsu:
O(m\cdotn) Isomorphism Algorithms for Circular-Arc Graphs and Circle Graphs.
297-311
- Brigitte Jaumard, Pierre Hansen, Marcus Poggi de Aragão:
Column Generation Methods for Probabilistic Logic.
313-331
- Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende:
Computational Experience with an Interior Point Algorithm on the Satisfiability Problem.
333-349
- Narendra Karmarkar:
An Interior-Point Approach to NP-Complete Problems.
351-366
- Samir Khuller, Joseph Naor:
Flow in Planar Graphs with Vertex Capacities.
367-384
- Shmuel Onn:
On the Radon Number of the Integer Lattice.
385-396
- András Recski, Frank Strzyzewski:
Vertex Disjoint Channel Routing on Two Layers.
397-405
- Bruce A. Reed:
Perfection, Parity, Planarity, and Packing Paths.
407-419
- Michael H. Schneider, Mark E. Hartmann, Hans Schneider:
Max-Balanced Flows.
421-429
- András Sebö:
Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization.
431-455
- E. C. Sewell, Leslie E. Trotter Jr.:
Stability Critical Graphs and Even Subdivisions of K_4.
457-466
- S. Sridhar, R. Chandrasekaran:
Integer Solution to Synthesis of Communication Networks.
467-483
- Michael A. Trick:
Scheduling Multiple Variable-Speed Machines.
485-494
- Steef L. van de Velde:
Dual Decomposition of Single Machine Scheduling Problems.
495-507
- Vijay V. Vazirani:
A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm.
509-530
Copyright © Sat Nov 14 05:07:35 2009
by Michael Ley (ley@uni-trier.de)
