Facets for continuous multi-mixing set with general coefficients and bounded integer variables

DOI10.1016/j.disopt.2017.05.002zbMath1387.90276OpenAlexW2620858056MaRDI QIDQ1751241

Manish Bansal, Kiavash Kianfar

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2017.05.002

zbMATH Keywords

mixed integer programmingcutting planes\(n\)-step cycle inequalities\(n\)-step MIR\(n\)-step minglingcontinuous mixing

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (5)

Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs ⋮ Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs ⋮ Facets for single module and multi-module capacitated lot-sizing problems without backlogging ⋮ Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs ⋮ On solving two-stage distributionally robust disjunctive programs with a general ambiguity set

Cites Work

• Unnamed Item
• Cover and pack inequalities for (mixed) integer programming
• \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
• Mingling: mixed-integer rounding with bounds
• The 0-1 knapsack problem with a single continuous variable
• On the facets of the mixed-integer knapsack polyhedron
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
• Valid inequalities based on simple mixed-integer sets
• Two-Step MIR Inequalities for Mixed Integer Programs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
• Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs
• n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem
• The Continuous Mixing Polyhedron
• Mixing mixed-integer inequalities

This page was built for publication: Facets for continuous multi-mixing set with general coefficients and bounded integer variables