28 search results - page 3 / 6 » Solving Packing Problem with Weaker Block Solvers |
CP
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
— Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
This paper presents an evaluation of the design decisions made in four state-of-the-art constraint solvers; Choco, ECLiPSe, Gecode, and Minion. To assess the impact of design deci...
WAOA
2005
Springer
13 years 11 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
ATMOS
2007
13 years 7 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...