scientific article

zbMath0808.90100MaRDI QIDQ3140425

Sebastián Ceria, Egon Balas, Cornuéjols, Gérard

Publication date: 15 December 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programming relaxationbranch-and-cutcutting plane algorithm

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Boolean programming (90C09)

Related Items

Bi-criteria and approximation algorithms for restricted matchings, A brief history of lift-and-project, The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem, Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem