Improving Dantzig-Wolfe relaxation through crosswise decomposition
Reformulation of mixed integer programs based on decomposition is a common approach to obtain stronger linear relaxation and thus better bounds in a branch-and-bound type algorithm.
Fouilhoux, Pierre +3 more
core +3 more sources
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
Dantzig-Wolfe decomposition is well-known to provide strong dual bounds for specially structured mixed integer programs (MIPs) in practice. However, the method is not implemented in any state-of-the-art MIP solver: it needs tailoring to the particular ...
Malaguti, Enrico +14 more
core +2 more sources
A Dantzig-Wolfe Decomposition Based Heuristic Scheme for Bi-level Dynamic Network Design Problem
Dynamic network design, Dantzig-Wolfe decomposition, Dual variables approximation, Cell transmission model,
S. Waller +2 more
core +1 more source
Mechanism Design via Dantzig-Wolfe Decomposition
In random allocation rules, typically first an optimal fractional point is calculated via solving a linear program. Lying in the feasible region of the linear program, the fractional point satisfies the underlying constraints.
Salman Fadaei
core
Automatic Dantzig-Wolfe Reformulation of Mixed Integer Linear Programs
Mange planlægnings- og beslutningsproblemer i den virkelig verden kan beskrivesmed matematiske optimeringsmodeller. Afhængig af problemets omfang, kandet være ekstremt profitabelt at finde gode løsninger; i 2009 blev tidsplanen forhele den Hollandske ...
Clausen, Jens Vinther
core
A hyper-matheuristic approach for solving mixed integer linear optimization models in the context of data envelopment analysis. [PDF]
Gonzalez M +3 more
europepmc +1 more source
Parallel Subgradient Algorithm with Block Dual Decomposition for Large-scale Optimization. [PDF]
Zheng Y +4 more
europepmc +1 more source
On the impact of resource relocation in facing health emergencies. [PDF]
Barbato M, Ceselli A, Premoli M.
europepmc +1 more source
Train maintenance personnel shift scheduling: case study. [PDF]
Gençer MA, Eren T, Alakaş HM.
europepmc +1 more source
Reliability constrained dynamic generation expansion planning using honey badger algorithm. [PDF]
Abou El Ela AA +4 more
europepmc +1 more source

