Sciweavers

IPCO
1998
87views Optimization» more  IPCO 1998»
14 years 24 days ago
Simple Generalized Maximum Flow Algorithms
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
Éva Tardos, Kevin D. Wayne
IPCO
1998
152views Optimization» more  IPCO 1998»
14 years 24 days ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
IPCO
1998
78views Optimization» more  IPCO 1998»
14 years 24 days ago
The Intersection of Knapsack Polyhedra and Extensions
Alexander Martin, Robert Weismantel
IPCO
1998
99views Optimization» more  IPCO 1998»
14 years 24 days ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
IPCO
1998
125views Optimization» more  IPCO 1998»
14 years 24 days ago
A Characterization of Weakly Bipartite Graphs
We give a proof of Guenin's theorem characterizing weakly bipartite graphs by not having an odd-K5 minor. The proof curtails the technical and case-checking parts of Guenin�...
Bertrand Guenin
IPCO
1998
97views Optimization» more  IPCO 1998»
14 years 24 days ago
The Packing Property
A clutter
Gérard Cornuéjols, Bertrand Guenin, ...
IPCO
1998
82views Optimization» more  IPCO 1998»
14 years 24 days ago
A Theorem of Truemper
Michele Conforti, Ajai Kapoor