Two-step MIR inequalities for mixed integer programs

DOI10.1287/IJOC.1090.0337MaRDI QIDQ2899057zbMATH OpenOpenAlexFDO

Authors Sanjeeb Dash, Marcos Goycoolea, Oktay Günlük

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1090.0337

zbMATH Keywords

mixed integer programmingpolyhedron separationrounding

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A two‐step method for mixed‐integer nonlinear programming problems
• On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
• On the facets of mixed integer programs with two integer variables and two constraints
• On a pair of nonlinear mixed integer programming problems
• Mirror-Descent Methods in Mixed-Integer Convex Optimization
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
• Valid inequalities for mixed integer linear programs
• Two linear approximation algorithms for convex mixed integer nonlinear programming
• Two step algorithm for solving regularized generalized mixed variational inequality problem
• scientific article; zbMATH DE number 3920195

Cited in

(17)

• Intersection cuts for single row corner relaxations
• Theoretical challenges towards cutting-plane selection
• Facets for continuous multi-mixing set with general coefficients and bounded integer variables
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• Valid inequalities based on simple mixed-integer sets
• Mixed integer rounding cuts and master group polyhedra
• Sequential Pairing of Mixed Integer Inequalities
• MIP* = RE
• A heuristic to generate rank-1 GMI cuts
• MIR closures of polyhedral sets
• \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
• A note on the MIR closure
• On the strength of Gomory mixed-integer cuts as group cuts
• Mingling: mixed-integer rounding with bounds
• Relations between facets of low- and high-dimensional group problems
• Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions

Describes a project that uses

Uses Software

• MIPLIB
• FEASPUMP
• MIPLIB2003

This page was built for publication: Two-step MIR inequalities for mixed integer programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899057)