Sparsity of Lift-and-Project Cutting Planes

DOI10.1007/978-3-319-00795-3_2zbMath1305.90313OpenAlexW2137678593MaRDI QIDQ5171772

Matthias Walter

Publication date: 12 February 2015

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-00795-3_2

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Beating the SDP bound for the floor layout problem: a simple combinatorial idea ⋮ Theoretical challenges towards cutting-plane selection ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting ⋮ Branch-and-bound solves random binary IPs in poly\((n)\)-time ⋮ Compressing branch-and-bound trees ⋮ Split cuts from sparse disjunctions ⋮ Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs ⋮ Sparse PSD approximation of the PSD cone

Uses Software

• SCIP
• MIPLIB