Characterization of the split closure via geometric lifting
type: Item
instance of: scholarly article
title: Characterization of the split closure via geometric lifting
zbMATH Open document ID: 1346.90604
author: Amitabh Basu
author: Marco Molinaro
published in: European Journal of Operational Research
publication date: 2016-10-06T00:00:00Z
full work available at URL: https://arxiv.org/abs/1701.06679
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6633456
zbMATH Keywords: integer programming
zbMATH Keywords: cutting-plane
zbMATH Keywords: split cut
zbMATH Keywords: cut-generating function
zbMATH Keywords: geometric lifting
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2055193102
arXiv ID: 1701.06679
cites work: Mixed Integer Programming: Analyzing 12 Years of Progress
cites work: Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
cites work: Split closure and intersection cuts
cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming
cites work: Disjunctive Programming
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Gomory cuts revisited
cites work: Optimizing over the split closure
cites work: On the relative strength of split, triangle and quadrilateral cuts
cites work: Intersection cuts with infinite Split rank
cites work: Q5465123
cites work: On optimizing over lift-and-project closures
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: Cut-Generating Functions
cites work: A Geometric Perspective on Lifting
cites work: Chvátal closures for mixed integer programming problems
cites work: Valid inequalities for mixed integer linear programs
cites work: \(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau
cites work: A heuristic to generate rank-1 GMI cuts
cites work: On \(t\)-branch split cuts for mixed-integer programs
cites work: A relax-and-cut framework for Gomory mixed-integer cuts
cites work: Q5645210
cites work: Q4128251
cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
DOI: 10.1016/J.EJOR.2014.12.018
description: scientific article; zbMATH DE number 6633456