IPCO 1992 | Sciweavers

17

IPCO
1992

112views Optimization» more IPCO 1992»

13 years 5 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 »

19

click to vote

IPCO
1992

100views Optimization» more IPCO 1992»

An Exact Characterization of Greedy Structures

13 years 5 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 »

16

click to vote

IPCO
1992

115views Optimization» more IPCO 1992»

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

13 years 5 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 »

13

click to vote

IPCO
1992

111views Optimization» more IPCO 1992»

A Technique for Speeding up the Solution of the Lagrangian Dual

13 years 5 months ago

Download jorlin.scripts.mit.edu

Dimitris Bertsimas, James B. Orlin

claim paper