default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. IPCO 1993: Erice, Italy
- Giovanni Rinaldi, Laurence A. Wolsey:
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993. CIACO 1993 - Imre Bárány, Roger Howe, Herbert E. Scarf:
The complex of maximal lattice free simplices. IPCO 1993: 1-9 - Ravi Kannan:
Optimal solution and value of parametric integer programs. IPCO 1993: 11-21 - Egon Balas, Matteo Fischetti:
On the monotonization of polyhedra. IPCO 1993: 23-38 - Philip N. Klein, R. Ravi:
When cycles collapse: A general approximation technique for constrained two-connectivity problems. IPCO 1993: 39-55 - Harold N. Gabow, Michel X. Goemans, David P. Williamson:
An efficient approximation algorithm for the survivable network design problem. IPCO 1993: 57-74 - Tibor Jordán:
Optimal and almost optimal algorithms for connectivity augmentation problems. IPCO 1993: 75-88 - Alexander Zelikovsky:
An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs. IPCO 1993: 89-98 - Robert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter:
Dynamic algorithms for optimization problems in bounded tree-width graphs. IPCO 1993: 99-112 - Anna Galluccio, Martin Loebl:
Cycles of prescribed modularity in planar digraphs. IPCO 1993: 113-127 - Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki:
Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. IPCO 1993: 129-145 - Hans Kellerer, Franz Rendl, Gerhard J. Woeginger:
Computing the optimum stock size. IPCO 1993: 147-159 - Florin Avram, Dimitris Bertsimas:
On a characterization of the minimum assignment and matching in the independent random model. IPCO 1993: 161-169 - Mark Jerrum:
An analysis of a Monte Carlo algorithm for estimating the permanent. IPCO 1993: 171-182 - Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl:
A spectral approach to bandwidth and separator problems in graphs. IPCO 1993: 183-194 - J. A. Hoogeveen, Steef L. van de Velde:
Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. IPCO 1993: 195-208 - E. Andrew Boyd:
Solving integer programs with Fenchel cutting planes and preprocessing. IPCO 1993: 209-220 - Michael Lomonosov, András Sebö:
On the geodesic-structure of graphs: a polyhedral approach to metric decomposition. IPCO 1993: 221-234 - Frieda Granot, Michal Penn:
On the (integral) maximum tw flow in vertex and edge capacitated planar graphs. IPCO 1993: 235-249 - Andrew V. Goldberg:
An efficient implementation of a scaling minimum-cost flow algorithm. IPCO 1993: 251-266 - William R. Pulleyblank, F. Bruce Shepherd:
Formulations for the stable set polytope of a claw-free graph. IPCO 1993: 267-279 - Naveen Garg, Vijay V. Vazirani:
A polyhedron with all s-t cuts as vertices, and adjacency of cuts. IPCO 1993: 281-289 - Jean-Maurice Clochard, Denis Naddef:
Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. IPCO 1993: 291-311 - Michel X. Goemans, David P. Williamson:
A new \frac34-approximation algorithm for MAX SAT. IPCO 1993: 313-321 - Philip N. Klein, R. Ravi:
A nearly best-possible approximation algorithm for node-weighted Steiner trees. IPCO 1993: 323-332 - Samir Khuller, Uzi Vishkin, Neal E. Young:
A primal-dual parallel approximation technique applied to weighted set and vertex cover. IPCO 1993: 333-341 - S. Thomas McCormick, Thomas R. Ervolina:
Canceling most helpful total submodular cuts for submodular flow. IPCO 1993: 343-353 - Dimitris Bertsimas, José Niño-Mora:
Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems. IPCO 1993: 355-384 - Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella:
A general class of greedily solvable linear programs. IPCO 1993: 385-399 - Masataka Nakamura:
Delta-polymatroids and an extension of Edmonds-Giles' TDI scheme. IPCO 1993: 401-412 - Zoltán Szigeti:
On Lovász's cathedral theorem. IPCO 1993: 413-423 - Shin-Ichi Nakano, Takao Nishizeki:
Nearly uniform scheduling of file transfers. IPCO 1993: 425-431 - András Sebö:
Circuit packings on surfaces with at most three cross-caps. IPCO 1993: 433-446 - Martin Grötschel, Alexander Martin, Robert Weismantel:
Routing in grid graphs by cutting planes. IPCO 1993: 447-461 - Rudolf Müller:
On the transitive acyclic subdigraph polytope. IPCO 1993: 463-477 - Michael Jünger, Petra Mutzel:
Solving the maximum weight planar subgraph. IPCO 1993: 479-492
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 00:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
