scientific article; zbMATH DE number 1757966

zbMath1010.90043MaRDI QIDQ4537754

Egon Balas, Michael Perregaard

Publication date: 20 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2081/20810348

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

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Computing deep facet-defining disjunctive cuts for mixed-integer programming, Local cuts for mixed-integer programming, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, Partial hyperplane activation for generalized intersection cuts, Disjunctive cuts in mixed-integer conic optimization, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs, Reflections on generating (disjunctive) cuts, Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming, The strength of multi-row models, Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints, Lift-and-project for general two-term disjunctions, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, Projection, lifting and extended formulation integer and combinatorial optimization