Branch-and-cut for complementarity and cardinality constrained linear programs
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Linear programming (90C05) Mixed integer programming (90C11) Combinatorial optimization (90C27) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Recommendations
- Branch-and-cut for complementarity-constrained optimization
- On the structure of linear programs with overlapping cardinality constraints
- Optimality conditions and numerical methods for a continuous reformulation of cardinality constrained optimization problems
- Solving linear programs with complementarity constraints using branch-and-cut
- On cutting planes for cardinality-constrained linear programs
Cited in
(7)- Cardinality constrained and multicriteria (multi)cut problems
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- On the structure of linear programs with overlapping cardinality constraints
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Branch-and-cut for complementarity-constrained optimization
- Relaxations and cutting planes for linear programs with complementarity constraints
- Global optimization of mixed-integer nonlinear programs with SCIP 8
This page was built for publication: Branch-and-cut for complementarity and cardinality constrained linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272522)
