IPCO
2007
13 years 10 months ago
2007
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
IPCO
2007
13 years 10 months ago
2007
In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice poin...
IPCO
2007
13 years 10 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
IPCO
2007
13 years 10 months ago
2007
IPCO
2008
13 years 10 months ago
2008
IPCO
2008
13 years 10 months ago
2008
IPCO
2008
13 years 10 months ago
2008
We discuss an implementation of the lexicographic version of Gomory's fractional cutting plane method and of two heuristics mimicking the latter. In computational testing on a...
IPCO
2008
13 years 10 months ago
2008
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to co...
IPCO
2008
13 years 10 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
IPCO
2008
13 years 10 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...