2. IPCO 1992:
Pittsburgh,
PA,
USA
Egon Balas, Gérard Cornuéjols, Ravi Kannan (Eds.):
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, May 1992.
Carnegie Mellon University 1992 BibTeX
@proceedings{DBLP:conf/ipco/1992,
editor = {Egon Balas and
G{\'e}rard Cornu{\'e}jols and
Ravi Kannan},
title = {Proceedings of the 2nd Integer Programming and Combinatorial
Optimization Conference, Pittsburgh, PA, May 1992},
booktitle = {IPCO},
publisher = {Carnegie Mellon University},
year = {1992},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Michel X. Goemans:
Polyhedral Description of Trees and Arborescences.
1-14 BibTeX
- Sunil Chopra:
The K-Edge Connected Spanning Subgraph Polyhedron.
15-29 BibTeX
- Francisco Barahona, Ali Ridha Mahjoub:
On 2-Connected Subgraph Polytopes.
30-43 BibTeX
- Dorit S. Hochbaum, Joseph Naor:
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality.
44-59 BibTeX
- Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano:
Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming.
61-71 BibTeX
- Martin E. Dyer, Alan M. Frieze:
Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex Algorithm.
72-84 BibTeX
- András Frank, Alexander V. Karzanov, András Sebö:
On Multiflow Problems.
85-101 BibTeX
- Farhad Shahrokhi, László A. Székely:
Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry.
102-113 BibTeX
- Xiaotie Deng, Pavol Hell, Jing Huang:
Recognition and Representation of Proper Circular Arc Graphs.
114-121 BibTeX
- J. A. Hoogeveen, H. Oosterhout, Steef L. van de Velde:
New Lower and Upper Bounds for Scheduling Around a Small Common Due Date.
122-135 BibTeX
- Jean B. Lasserre, Maurice Queyranne:
Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling.
136-149 BibTeX
- Yves Pochet, Laurence A. Wolsey:
Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems.
150-164 BibTeX
- Pierre Hansen, Brigitte Jaumard, Marcus Poggi de Aragão:
Mixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem.
165-180 BibTeX
- Silvano Martello, François Soumis, Paolo Toth:
An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines.
181-200 BibTeX
- Paolo Nobili, Antonio Sassano:
A Separation Routine for the Set Covering Polytope.
201-219 BibTeX
- Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks:
A Complexity Index for Satisfiability Problems.
220-226 BibTeX
- Guoliang Xue, J. Ben Rosen, Panos M. Pardalos:
A Polynomial Time Dual Algorithm for the Euclidean Multifacility Location Problem.
227-236 BibTeX
- Alexander A. Ageev:
A Criterion of Polynomial-Time Solvability for the Network Location Problem.
237-245 BibTeX
- William H. Cunningham, Fan Zhang:
Subgraph Degree-Sequence Polyhedra.
246-259 BibTeX
- Matteo Fischetti:
Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope.
260-273 BibTeX
- Monique Laurent, Svatopluk Poljak:
The Metric Polytope.
274-286 BibTeX
- Paul Helman, Bernard M. E. Moret, Henry D. Shapiro:
An Exact Characterization of Greedy Structures.
287-297 BibTeX
- Partha P. Bhattacharya, Leonidas Georgiadis, Pantelis Tsoucas:
Extended Polymatroids: Properties and Optimization.
298-315 BibTeX
- Alexander I. Barvinok:
Optimization Problems on Matroids and Exponential Sums.
316-333 BibTeX
- Péter L. Erdös, László A. Székely:
Algorithms and Min-max Theorems for Certain Multiway Cuts.
334-345 BibTeX
- Cor A. J. Hurkens:
Nasty TSP Instances for Farthest Insertion.
346-352 BibTeX
- András Sebö:
Forcing Colorations and the Strong Perfect Graph Conjecture.
353-366 BibTeX
- Lov K. Grover:
Fast Parallel Algorithms for Bipartite Matching.
367-384 BibTeX
- Farid Alizadeh:
Combinatorial Optimization with Semi-Definite Matrices.
385-405 BibTeX
- Narendra Karmarkar, S. A. Thakur:
An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems.
406-420 BibTeX
- Daniel Bienstock:
A Lot-Sizing Problem on Trees, Related to Network Design.
421-434 BibTeX
- Dimitris Bertsimas, James B. Orlin:
A Technique for Speeding up the Solution of the Lagrangian Dual.
435-452 BibTeX
- Alan M. Frieze, Richard M. Karp, Bruce A. Reed:
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?
453-461 BibTeX
Copyright © Sat May 16 23:24:19 2009
by Michael Ley (ley@uni-trier.de)
