Split cuts in the plane
Optimization and Control
2020-11-12 v2
Abstract
We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.
Cite
@article{arxiv.2003.05022,
title = {Split cuts in the plane},
author = {Amitabh Basu and Michele Conforti and Marco Di Summa and Hongyi Jiang},
journal= {arXiv preprint arXiv:2003.05022},
year = {2020}
}
Related papers
View all related →
Optimization and Control · Mathematics
On the depth of cutting planes
Laurent Poirrier, James Yu
2019-03-14
Optimization and Control · Mathematics
Two-halfspace closure
Amitabh Basu, Hongyi Jiang
2021-08-18
Data Structures and Algorithms · Computer Science
Optimal Cuts and Bisections on the Real Line in Polynomial Time
Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2012-07-05
Discrete Mathematics · Computer Science
Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs
Matthias Walter
2020-11-13
Computational Geometry · Computer Science
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
Stefan Langerman, Andrew Winslow
2016-03-10
Optimization and Control · Mathematics
Learning to Remove Cuts in Integer Linear Programming
Pol Puigdemont, Stratis Skoulakis, Grigorios Chrysos, Volkan Cevher
2024-06-28
Optimization and Control · Mathematics
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
Alberto Del Pia, Robert Hildebrand, Robert Weismantel, Kevin Zemmer
2015-05-07
Data Structures and Algorithms · Computer Science
The Cutting Plane Method is Polynomial for Perfect Matchings
Karthekeyan Chandrasekaran, Laszlo A. Vegh, Santosh Vempala
2014-01-24
Optimization and Control · Mathematics
N-Fold Integer Programming
Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel
2008-07-24
Optimization and Control · Mathematics
An analysis of mixed integer linear sets based on lattice point free convex sets
Kent Andersen, Quentin Louveaux, Robert Weismantel
2009-06-30
Combinatorics · Mathematics
Algorithms for orthogonal partitioning into four parts
Alexey Fakhrutdinov, Oleg R. Musin
2026-02-03
Optimization and Control · Mathematics
k-Disjunctive cuts and a finite cutting plane algorithm for general mixed integer linear programs
Markus Jörg
2007-07-27
Optimization and Control · Mathematics
A computational study of cutting-plane methods for multi-stage stochastic integer programs
Akul Bansal, Simge Küçükyavuz
2024-05-07
Optimization and Control · Mathematics
An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
Liang Chen, Wei-Kun Chen, Mu-Ming Yang, Yu-Hong Dai
2020-11-10
Computational Complexity · Computer Science
Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
Chee-Khian Sim
2025-12-24
Optimization and Control · Mathematics
Learning Cuts via Enumeration Oracles
Daniel Thuerck, Boro Sofranac, Marc E. Pfetsch, Sebastian Pokutta
2024-01-26
Optimization and Control · Mathematics
A Finite-Time Cutting Plane Algorithm for Distributed Mixed Integer Linear Programming
Andrea Testa, Alessandro Rucco, Giuseppe Notarstefano
2017-12-06
Combinatorics · Mathematics
An efficient algorithm for packing cuts and (2,3)-metrics in a planar graph with three holes
Alexander V. Karzanov
2018-03-20
Optimization and Control · Mathematics
Machine Learning for Cutting Planes in Integer Programming: A Survey
Arnaud Deza, Elias B. Khalil
2023-11-01
Combinatorics · Mathematics
The Best Ways to Slice a Polytope
Marie-Charlotte Brandenburg, Jesús A. De Loera, Chiara Meroni
2025-06-02
Data Structures and Algorithms · Computer Science
Optimal Cuts and Partitions in Tree Metrics in Polynomial Time
Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu
2012-12-17
Computational Geometry · Computer Science
Cutting a Convex Polyhedron Out of a Sphere
Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam
2010-03-10
Numerical Analysis · Mathematics
Temporal Splitting algorithms for non-stationary multiscale problems
Yalchin Efendiev, Sai-Mang Pun, Petr N. Vabishchevich
2021-06-02
Optimization and Control · Mathematics
Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset
Dmitrii Lozovanu
2025-02-13
Optimization and Control · Mathematics
Continuous cutting plane algorithms in integer programming
Didier Chételat, Andrea Lodi
2023-07-10