IPCO 2007 | Sciweavers

42

IPCO
1992

112views Optimization» more IPCO 1992»

14 years 1 months ago

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

claim paper

Read More »

42

click to vote

IPCO
1992

100views Optimization» more IPCO 1992»

An Exact Characterization of Greedy Structures

14 years 1 months ago

Download faculty.cs.tamu.edu

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

claim paper

Read More »

39

click to vote

IPCO
1992

115views Optimization» more IPCO 1992»

When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?

14 years 1 months ago

Download www.math.cmu.edu

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

claim paper

Read More »

39

click to vote

IPCO
1992

111views Optimization» more IPCO 1992»

A Technique for Speeding up the Solution of the Lagrangian Dual

14 years 1 months ago

Download jorlin.scripts.mit.edu

Dimitris Bertsimas, James B. Orlin

claim paper

Read More »

29

click to vote

IPCO
1990

85views Optimization» more IPCO 1990»

Conservative Weightings and Ear-Decompositions of Graphs

14 years 1 months ago

Download www.cs.elte.hu

András Frank

claim paper

Read More »

33

click to vote

IPCO
1990

76views Optimization» more IPCO 1990»

Probabilistic Analysis of the Generalised Assignment Problem

14 years 1 months ago

Download www.math.cmu.edu

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

claim paper

Read More »

32

click to vote

IPCO
1993

104views Optimization» more IPCO 1993»

Nearly uniform scheduling of file transfers

14 years 1 months ago

Download www.nishizeki.ecei.tohoku.ac.jp

Shin-Ichi Nakano, Takao Nishizeki

claim paper

Read More »

30

click to vote

IPCO
1993

104views Optimization» more IPCO 1993»

An analysis of a Monte Carlo algorithm for estimating the permanent

14 years 1 months ago

Download www.math.cmu.edu

Mark Jerrum

claim paper

Read More »

45

click to vote

IPCO
1993

98views Optimization» more IPCO 1993»

A spectral approach to bandwidth and separator problems in graphs

14 years 1 months ago

Download www-user.tu-chemnitz.de

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,...

claim paper

Read More »

38

click to vote

IPCO
1993

144views Optimization» more IPCO 1993»

Routing in grid graphs by cutting planes

14 years 1 months ago

Download www.zib.de

Martin Grötschel, Alexander Martin, Robert We...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers