Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
type: Item
instance of: scholarly article
title: Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
zbMATH Open document ID: 1409.90114
author: Tobias Fischer
author: Marc E. Pfetsch
published in: Operations Research Letters
publication date: 2019-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7027805
zbMATH Keywords: disjunctive cuts
zbMATH Keywords: monoidal cut strengthening
zbMATH Keywords: mixed-integer rounding
zbMATH Keywords: complementarity constraints
describes a project that uses: SCIP
MaRDI profile type: Publication
full work available at URL: j.orl.2017.08.012
OpenAlex ID: W2746501349
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Strengthening cuts for mixed integer programs
cites work: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
cites work: Monoidal cut strengthening revisited
cites work: Measuring the impact of primal heuristics
cites work: Cutting planes from two-term disjunctions
cites work: Integer Programming
cites work: Elementary closures for integer programs.
cites work: Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
cites work: Two row mixed-integer cuts via lifting
cites work: Branch-and-cut for linear programs with overlapping SOS1 constraints
cites work: The capacity of wireless networks
cites work: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
cites work: Lift-and-project for general two-term disjunctions
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs
cites work: Q4040221
cites work: SCIP: solving constraint integer programs
cites work: Q4254875
DOI: 10.1016/J.ORL.2017.08.012
description: scientific article; zbMATH DE number 7027805