CPAIOR
2010
Springer
13 years 2 months ago
2010
Springer
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...
CPAIOR
2010
Springer
13 years 2 months ago
2010
Springer
CPAIOR
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. This paper reconsiders the deployment of synchronous optical networks (SONET), an optimization problem naturally expressed in terms of set variables. Earlier approaches, ...
CPAIOR
2010
Springer
13 years 3 months ago
2010
Springer
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...
CPAIOR
2010
Springer
13 years 4 months ago
2010
Springer
CPAIOR
2010
Springer
13 years 6 months ago
2010
Springer
CPAIOR
2010
Springer
13 years 7 months ago
2010
Springer
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...
CPAIOR
2010
Springer
13 years 7 months ago
2010
Springer
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...
CPAIOR
2010
Springer
13 years 7 months ago
2010
Springer
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 ...
CPAIOR
2010
Springer
13 years 9 months ago
2010
Springer
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...