3. IPCO 1993:
Erice,
Italy
Giovanni Rinaldi, Laurence A. Wolsey (Eds.):
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993.
CIACO 1993 BibTeX
@proceedings{DBLP:conf/ipco/1993,
editor = {Giovanni Rinaldi and
Laurence A. Wolsey},
title = {Proceedings of the 3rd Integer Programming and Combinatorial
Optimization Conference, Erice, Italy, April 29 - May 1, 1993},
booktitle = {IPCO},
publisher = {CIACO},
year = {1993},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Imre Bárány, Roger Howe, Herbert E. Scarf:
The complex of maximal lattice free simplices.
1-9 BibTeX
- Ravi Kannan:
Optimal solution and value of parametric integer programs.
11-21 BibTeX
- Egon Balas, Matteo Fischetti:
On the monotonization of polyhedra.
23-38 BibTeX
- Philip N. Klein, R. Ravi:
When cycles collapse: A general approximation technique for constrained two-connectivity problems.
39-55 BibTeX
- Harold N. Gabow, Michel X. Goemans, David P. Williamson:
An efficient approximation algorithm for the survivable network design problem.
57-74 BibTeX
- Tibor Jordán:
Optimal and almost optimal algorithms for connectivity augmentation problems.
75-88 BibTeX
- Alexander Zelikovsky:
An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs.
89-98 BibTeX
- Robert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter:
Dynamic algorithms for optimization problems in bounded tree-width graphs.
99-112 BibTeX
- Anna Galluccio, Martin Loebl:
Cycles of prescribed modularity in planar digraphs.
113-127 BibTeX
- Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki:
Sequential and parallel algorithms for edge-coloring series-parallel multigraphs.
129-145 BibTeX
- Hans Kellerer, Franz Rendl, Gerhard J. Woeginger:
Computing the optimum stock size.
147-159 BibTeX
- Florin Avram, Dimitris Bertsimas:
On a characterization of the minimum assignment and matching in the independent random model.
161-169 BibTeX
- Mark Jerrum:
An analysis of a Monte Carlo algorithm for estimating the permanent.
171-182 BibTeX
- Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl:
A spectral approach to bandwidth and separator problems in graphs.
183-194 BibTeX
- J. A. Hoogeveen, Steef L. van de Velde:
Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems.
195-208 BibTeX
- E. Andrew Boyd:
Solving integer programs with Fenchel cutting planes and preprocessing.
209-220 BibTeX
- Michael Lomonosov, András Sebö:
On the geodesic-structure of graphs: a polyhedral approach to metric decomposition.
221-234 BibTeX
- Frieda Granot, Michal Penn:
On the (integral) maximum tw flow in vertex and edge capacitated planar graphs.
235-249 BibTeX
- Andrew V. Goldberg:
An efficient implementation of a scaling minimum-cost flow algorithm.
251-266 BibTeX
- William R. Pulleyblank, F. Bruce Shepherd:
Formulations for the stable set polytope of a claw-free graph.
267-279 BibTeX
- Naveen Garg, Vijay V. Vazirani:
A polyhedron with all s-t cuts as vertices, and adjacency of cuts.
281-289 BibTeX
- Jean-Maurice Clochard, Denis Naddef:
Using path inequalities in a branch and cut code for the symmetric traveling salesman problem.
291-311 BibTeX
- Michel X. Goemans, David P. Williamson:
A new \frac34-approximation algorithm for MAX SAT.
313-321 BibTeX
- Philip N. Klein, R. Ravi:
A nearly best-possible approximation algorithm for node-weighted Steiner trees.
323-332 BibTeX
- Samir Khuller, Uzi Vishkin, Neal E. Young:
A primal-dual parallel approximation technique applied to weighted set and vertex cover.
333-341 BibTeX
- S. Thomas McCormick, Thomas R. Ervolina:
Canceling most helpful total submodular cuts for submodular flow.
343-353 BibTeX
- Dimitris Bertsimas, José Niño-Mora:
Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems.
355-384 BibTeX
- Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella:
A general class of greedily solvable linear programs.
385-399 BibTeX
- Masataka Nakamura:
Delta-polymatroids and an extension of Edmonds-Giles' TDI scheme.
401-412 BibTeX
- Zoltán Szigeti:
On Lovász's cathedral theorem.
413-423 BibTeX
- Shin-Ichi Nakano, Takao Nishizeki:
Nearly uniform scheduling of file transfers.
425-431 BibTeX
- András Sebö:
Circuit packings on surfaces with at most three cross-caps.
433-446 BibTeX
- Martin Grötschel, Alexander Martin, Robert Weismantel:
Routing in grid graphs by cutting planes.
447-461 BibTeX
- Rudolf Müller:
On the transitive acyclic subdigraph polytope.
463-477 BibTeX
- Michael Jünger, Petra Mutzel:
Solving the maximum weight planar subgraph.
479-492 BibTeX
Copyright © Sat May 16 23:24:19 2009
by Michael Ley (ley@uni-trier.de)
