Reformulating the disjunctive cut generating linear program
type: Item
instance of: scholarly article
title: Reformulating the disjunctive cut generating linear program
zbMATH Open document ID: 1456.90105
author: Thiago Serra
published in: Annals of Operations Research
publication date: 2021-01-07T00:00:00Z
full work available at URL: https://digitalcommons.bucknell.edu/cgi/viewcontent.cgi
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7290962
zbMATH Keywords: cutting planes
zbMATH Keywords: lift-and-project
zbMATH Keywords: integer programming
describes a project that uses: SHOT
MaRDI profile type: Publication
OpenAlex ID: W3043255943
cites work: Q3425132
cites work: A modified lift-and-project procedure
cites work: Disjunctive programming: Properties of the convex hull of feasible points
cites work: Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
cites work: Lift-and-project for mixed 0-1 programming: recent progress
cites work: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
cites work: Acceleration of cutting-plane and column generation algorithms: Applications to network design
cites work: On optimizing over lift-and-project closures
cites work: Regularizing the abstract convex program
cites work: Local cuts revisited
cites work: Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
cites work: An Exact Algorithm for Robust Network Design
cites work: Computing deep facet-defining disjunctive cuts for mixed-integer programming
cites work: Reflections on generating (disjunctive) cuts
cites work: An In-Out Approach to Disjunctive Optimization
cites work: On the separation of disjunctive cuts
cites work: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
cites work: The strength of multi-row models
cites work: The Supporting Hyperplane Method for Unimodal Programming
DOI: 10.1007/S10479-020-03709-2
description: scientific article; zbMATH DE number 7290962