Cgllandp
CglLandP: This procedure implements different variants of the lift-and-project procedure executed in the LP simplex tableau described by Balas and Perregaard. The code has been developped in a joint work with Egon Balas.
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
Sorted by year (- Bonami, Pierre: On optimizing over lift-and-project closures (2012)
- Fischetti, Matteo; Salvagnin, Domenico: A relax-and-cut framework for Gomory mixed-integer cuts (2011)
- Dash, Sanjeeb; Goycoolea, Marcos: A heuristic to generate rank-1 GMI cuts (2010)
- Dash, Sanjeeb; Günlük, Oktay; Lodi, Andrea: MIR closures of polyhedral sets (2010)
- Balas, Egon; Bonami, Pierre: Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (2009)