808 search results - page 121 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
EOR
2008
13 years 11 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
ESA
2005
Springer
14 years 4 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
ANOR
2002
13 years 10 months ago
2002
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model inco...
FLAIRS
2004
14 years 7 days ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
CP
2007
Springer
14 years 5 months ago
2007
Springer
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible – as...