23 search results - page 3 / 5 » Solving Integer and Disjunctive Programs by Lift and Project |
CC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
115
click to vote
WEA
2010
Springer
15 years 4 months ago
2010
Springer
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 ...
INFORMS
2008
14 years 9 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
DISOPT
2008
14 years 9 months ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...