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