400 search results - page 7 / 80 » Extended formulations in combinatorial optimization |
169
Voted
CCO
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
182
click to vote
ESA
2007
Springer
16 years 4 hour ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
148
Voted
WABI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
164
click to vote
IJCAI
2003
15 years 7 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
181
click to vote
EVOW
2009
Springer
15 years 10 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...