126 search results - page 2 / 26 » Surrogate constraint normalization for the set covering prob... |
AAIM
2009
Springer
14 years 26 days ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
AI
2001
Springer
13 years 10 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
COR
2007
13 years 6 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...