Continuous cutting plane algorithms in integer programming

DOI10.1016/j.orl.2023.06.004zbMath1525.90282arXiv2204.09122OpenAlexW4382934680MaRDI QIDQ6047699

Andrea Lodi, Didier Chételat

Publication date: 12 September 2023

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

Full work available at URL: https://arxiv.org/abs/2204.09122

zbMATH Keywords

integer programmingneural networkssubadditive functionscutting planes

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11)

Cites Work

• Unnamed Item
• A comparison of heuristics and relaxations for the capacitated plant location problem
• MIR closures of polyhedral sets
• Mixed-integer cuts from cyclic groups
• Optimizing over the first Chvátal closure
• Valid inequalities for mixed integer linear programs
• Cutting-plane theory: Algebraic methods
• Discrete Optimization with Decision Diagrams
• Subadditive periodic functions
• Mixed Integer Programming Computation
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Minimal inequalities
• Integer programming duality: Price functions and sensitivity analysis
• TSPLIB—A Traveling Salesman Problem Library
• Maximum matching and a polyhedron with 0,1-vertices