Sciweavers

132 search results - page 7 / 27
» Postponing Branching Decisions
Sort
View
UAI
2003
13 years 8 months ago
Optimal Limited Contingency Planning
For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications wher...
Nicolas Meuleau, David E. Smith
COR
2011
13 years 2 months ago
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Branching in mixed-integer (or integer) linear programming requires choosing both the branching variable and the branching direction. This paper develops a number of new methods f...
Jennifer Pryor, John W. Chinneck
OTM
2010
Springer
13 years 5 months ago
Towards Evaluating GRASIM for Ontology-Based Data Matching
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
Yan Tang
CP
2007
Springer
14 years 1 months ago
Limitations of Restricted Branching in Clause Learning
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
Matti Järvisalo, Tommi A. Junttila
ANOR
2005
124views more  ANOR 2005»
13 years 7 months ago
On Compact Formulations for Integer Programs Solved by Column Generation
Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subprobl...
Daniel Villeneuve, Jacques Desrosiers, Marco E. L&...