Sciweavers

CPAIOR
2008
Springer
14 years 19 days ago
The Steel Mill Slab Design Problem Revisited
Pascal Van Hentenryck, Laurent Michel
CPAIOR
2008
Springer
14 years 19 days ago
Efficient Haplotype Inference with Combined CP and OR Techniques
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
Ana Graça, João Marques-Silva, In&ec...
CPAIOR
2008
Springer
14 years 19 days ago
Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
Tobias Achterberg, Stefan Heinz, Thorsten Koch
CPAIOR
2008
Springer
14 years 19 days ago
A Novel Approach For Detecting Symmetries in CSP Models
Abstract. While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetr...
Christopher Mears, Maria J. García de la Ba...
CPAIOR
2008
Springer
14 years 19 days ago
Propagating Separable Equalities in an MDD Store
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
Tarik Hadzic, John N. Hooker, Peter Tiedemann
CPAIOR
2008
Springer
14 years 19 days ago
Constraint Integer Programming: A New Approach to Integrate CP and MIP
Tobias Achterberg, Timo Berthold, Thorsten Koch, K...
CPAIOR
2008
Springer
14 years 19 days ago
Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
Ivan Heckman, J. Christopher Beck
CPAIOR
2008
Springer
14 years 19 days ago
Multi-stage Benders Decomposition for Optimizing Multicore Architectures
Luca Benini, Michele Lombardi, Marco Mantovani, Mi...
CPAIOR
2008
Springer
14 years 19 days ago
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
Alex S. Fukunaga
CPAIOR
2008
Springer
14 years 19 days ago
Filtering Atmost1 on Pairs of Set Variables
Willem Jan van Hoeve, Ashish Sabharwal