Projective cutting-planes
From MaRDI portal
Recommendations
- Exact separation of k-projection polytope constraints
- Using projected cutting planes in the extended cutting plane method
- Cutting planes and column generation techniques with the projective algorithm
- A projection cutting plane algorithm for convex programming problems
- Fenchel Cutting Planes for Integer Programs
Cites work
- A survey of dual-feasible and superadditive functions
- A survey on Benders decomposition applied to fixed-charge network design problems
- An exact approach for the vertex coloring problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Cutting Stock Problems
- Ellipsoidal relaxations of the stable set problem: theory and algorithms
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
- Interior point methods 25 years later
- Large-scale optimization with the primal-dual column generation method
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Partitioning procedures for solving mixed-variables programming problems
- Programming with linear fractional functionals
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
- Selected Topics in Column Generation
Cited in
(4)
This page was built for publication: Projective cutting-planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221062)
