Sciweavers

Share
IPCO
1992
112views Optimization» more  IPCO 1992»
9 years 2 months ago
The Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
Monique Laurent, Svatopluk Poljak
IPCO
1992
100views Optimization» more  IPCO 1992»
9 years 2 months ago
An Exact Characterization of Greedy Structures
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
IPCO
1992
115views Optimization» more  IPCO 1992»
9 years 2 months ago
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?
We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume ...
Alan M. Frieze, Richard M. Karp, Bruce A. Reed
IPCO
1990
76views Optimization» more  IPCO 1990»
9 years 2 months ago
Probabilistic Analysis of the Generalised Assignment Problem
We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved...
Martin E. Dyer, Alan M. Frieze
IPCO
1993
98views Optimization» more  IPCO 1993»
9 years 2 months ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...
IPCO
1993
144views Optimization» more  IPCO 1993»
9 years 2 months ago
Routing in grid graphs by cutting planes
Martin Grötschel, Alexander Martin, Robert We...
books