Sciweavers

Share
CPAIOR
2010
Springer
8 years 2 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
CPAIOR
2010
Springer
8 years 2 months ago
On Matrices, Automata, and Double Counting
Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, ...
CPAIOR
2010
Springer
8 years 2 months ago
Boosting Set Constraint Propagation for Network Design
Abstract. This paper reconsiders the deployment of synchronous optical networks (SONET), an optimization problem naturally expressed in terms of set variables. Earlier approaches, ...
Justin Yip, Pascal Van Hentenryck, Carmen Gervet
CPAIOR
2010
Springer
8 years 2 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...
CPAIOR
2010
Springer
8 years 4 months ago
Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution
Pascal Van Hentenryck, Russell Bent, Carleton Coff...
CPAIOR
2010
Springer
8 years 6 months ago
Constraint Programming and Combinatorial Optimisation in Numberjack
Emmanuel Hebrard, Eoin O'Mahony, Barry O'Sullivan
CPAIOR
2010
Springer
8 years 7 months ago
An In-Out Approach to Disjunctive Optimization
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
Matteo Fischetti, Domenico Salvagnin
CPAIOR
2010
Springer
8 years 7 months ago
Hybrid Methods for the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
CPAIOR
2010
Springer
8 years 7 months ago
Automated Configuration of Mixed Integer Programming Solvers
Abstract. State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific ...
Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown
CPAIOR
2010
Springer
8 years 9 months ago
Upper Bounds on the Number of Solutions of Binary Integer Programs
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
books