Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective

DOI10.1007/s10288-020-00459-6zbMath1522.90037arXiv1811.02345OpenAlexW3116714130MaRDI QIDQ6057717

Marco Di Summa, Michele Conforti, Francesco Rinaldi, Marianna De Santis

Publication date: 26 October 2023

Published in: 4OR (Search for Journal in Brave)

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

zbMATH Keywords

nonlinear integer programmingvalid inequalitiescutting plane method

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to convexify the intersection of a second order cone and a nonconvex quadratic
• Page cuts for integer interval linear programming
• Convex hulls of superincreasing knapsacks and lexicographic orderings
• A finitely converging cutting plane technique
• Another pedagogy for mixed-integer Gomory
• A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
• A simple finite cutting plane algorithm for integer programs
• A branch-and-cut method for 0-1 mixed convex programming
• Convex programming for disjunctive convex optimization
• On the Chvátal-Gomory closure of a compact convex set
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• On families of quadratic surfaces having fixed intersections with two hyperplanes
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Another pedagogy for pure-integer Gomory
• Integer Programming
• Outline of an algorithm for integer solutions to linear programs
• Intersection Cuts for Mixed Integer Conic Quadratic Sets
• Mixed-integer nonlinear optimization
• A finiteness proof for modified dantzig cuts in integer programming
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets