scientific article; zbMATH DE number 1757966
From MaRDI portal
Publication:4537754
zbMATH Open1010.90043MaRDI QIDQ4537754FDOQ4537754
Authors: Michael Perregaard, E. Balas 
Publication date: 20 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2081/20810348
Title of this publication is not available (Why is that?)
Recommendations
- Reflections on generating (disjunctive) cuts
- On the separation of disjunctive cuts
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
- Generating cut conjunctions in graphs and related problems
- Cutting planes from two-term disjunctions
- Split cuts from sparse disjunctions
- On disjunctive cuts for combinatorial optimization
- Disjunctive logic programs, answer sets, and the cut rule
- scientific article; zbMATH DE number 1114456
- A logical approach to multicut problems
Cited In (16)
- Lift-and-project for general two-term disjunctions
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
- Local cuts for mixed-integer programming
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- The strength of multi-row models
- Reflections on generating (disjunctive) cuts
- Disjunctive cuts in mixed-integer conic optimization
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Projection, lifting and extended formulation integer and combinatorial optimization
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Partial hyperplane activation for generalized intersection cuts
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints
- Cutting planes from two-term disjunctions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537754)
