Sciweavers

136 search results - page 13 / 28
» The Satisfiability Problem for Probabilistic Ordered Branchi...
Sort
View
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
CPAIOR
2010
Springer
13 years 11 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
2008
Springer
13 years 9 months 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...
SAT
2004
Springer
95views Hardware» more  SAT 2004»
14 years 1 months ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke
ATAL
2010
Springer
13 years 8 months ago
Merging example plans into generalized plans for non-deterministic environments
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...