Projective Cutting-Planes

DOI10.1137/19M1272652zbMath1441.90140OpenAlexW3013252004MaRDI QIDQ5221062

Daniel Cosmin Porumbel

Publication date: 27 March 2020

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/19m1272652

zbMATH Keywords

polytopescolumn generationrobust optimization\texttt{Cutting-Planes}separation subproblem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Related Items (1)

Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems

Cites Work

• Large-scale optimization with the primal-dual column generation method
• An exact approach for the vertex coloring problem
• Interior point methods 25 years later
• A survey of dual-feasible and superadditive functions
• Partitioning procedures for solving mixed-variables programming problems
• From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
• A survey on Benders decomposition applied to fixed-charge network design problems
• Maximum-weight stable sets and safe lower bounds for graph coloring
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms
• Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
• Selected Topics in Column Generation
• Programming with linear fractional functionals
• Cutting Stock Problems
• Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
• Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation

This page was built for publication: Projective Cutting-Planes