35 search results - page 1 / 7 » Decomposition and Dynamic Cut Generation in Integer Linear P... |
MP
2006
13 years 4 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
SIAMJO
2008
13 years 4 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
IOR
2006
13 years 4 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
IPCO
2001
13 years 6 months ago
2001
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
CCE
2008
13 years 5 months ago
2008
The problem of optimal synthesis of an integrated water system is addressed in this work, where water using processes and water treatment operations are combined into a single net...