scientific article

From MaRDI portal

Revision as of 07:41, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3140425

Jump to:navigation, search

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 relaxation branch-and-cut cutting plane algorithm

Mathematics Subject Classification ID

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

Related Items (5)

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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3140425&oldid=16438371"