IPCO
2001
14 years 25 days ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
IPCO
2001
14 years 25 days ago
2001
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
IPCO
2001
14 years 25 days ago
2001
IPCO
2001
14 years 25 days ago
2001
Abstract. We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The op...
IPCO
2001
14 years 25 days ago
2001
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
IPCO
2001
14 years 25 days ago
2001
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to ...
IPCO
2001
14 years 25 days ago
2001
IPCO
2001
14 years 25 days ago
2001
IPCO
2001
14 years 25 days ago
2001
IPCO
2001
14 years 25 days ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...