IPCO
2004
13 years 5 months ago
2004
IPCO
2004
13 years 5 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
IPCO
2004
13 years 5 months ago
2004
Let P be a random 0/1-polytope in d with n(d) vertices, and denote by k(P) the k-face density of P, i.e., the quotient of the number of k-dimensional faces of P and `n(d) k+1
IPCO
2004
13 years 5 months ago
2004
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...
IPCO
2004
13 years 5 months ago
2004
IPCO
2004
13 years 5 months ago
2004
IPCO
2004
13 years 5 months ago
2004
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an efficie...
IPCO
2004
13 years 5 months ago
2004
IPCO
2004
13 years 5 months ago
2004
IPCO
2004
13 years 5 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...