23 search results - page 2 / 5 » Solving Integer and Disjunctive Programs by Lift and Project |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
CPAIOR
2010
Springer
15 years 24 days 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...
COLOGNETWENTE
2009
14 years 10 months ago
2009
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
120
click to vote
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
IPCO
2008
14 years 11 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...