Similar Search Results

LS-LIB : a library of reformulations, cut separation algorithms and primal heuristics in a high-level modeling language for solving MIP production planning problems

Pochet, Yves (contributor); Van Vyve, Mathieu (contributor); … - 2005

Persistent link: https://www.econbiz.de/10003289415

Modeling poset convex subsets

Queyranne, Maurice; Wolsey, Laurence A. - 2015

Persistent link: https://www.econbiz.de/10011580758

Benders' algorithm with (mixed)-integer subproblems

Weninger, Dieter; Wolsey, Laurence A. - 2019

Persistent link: https://www.econbiz.de/10012215144

"Facet" separation with one linear program

Conforti, Michele; Wolsey, Laurence A. - 2016

Persistent link: https://www.econbiz.de/10011749293

A cutting plane algorithm for the capacitated facility location problem

Avella, Pasquale; Boccia, Maurizio - In: Computational optimization and applications : an … 43 (2009) 1, pp. 39-65

Persistent link: https://www.econbiz.de/10003860211

A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries

Archetti, Claudia; Speranza, Maria Grazia; Boccia, Maurizio - In: European journal of operational research : EJOR 282 (2020) 3, pp. 886-895

Persistent link: https://www.econbiz.de/10012161807

Ls-Lib : A Library of Reformulations, Cut Separation Algorithms and Primal Heuristics in a High-Level Modeling Language for Solving MIP Production Planning Problems

Pochet, Yves - 2006

Much progress has been made in recent years in solving certain classes of production planning problems using mixed integer programming. One of the major challenges is how to make this expertise available and easy to use to the non-specialist and to the practitioners. Here we describe a modeling...

Persistent link: https://www.econbiz.de/10012733345