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

DOI10.1016/J.DISOPT.2017.05.002MaRDI QIDQ1751241zbMATH OpenOpenAlexFDO

Authors Manish Kumar 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

\(n\)-step cycle inequalities\(n\)-step mingling\(n\)-step MIRcontinuous mixingcutting planesmixed integer programming

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)

Recommendations

• The Continuous Mixing Polyhedron
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
• \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
• Mixing polyhedra with two non divisible coefficients
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra

Cites work

• N-step cycle inequalities: facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem
• \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
• \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Cover and pack inequalities for (mixed) integer programming
• Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• scientific article; zbMATH DE number 3470175 (Why is no real title available?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Mingling: mixed-integer rounding with bounds
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
• Mixing mixed-integer inequalities
• On the facets of the mixed-integer knapsack polyhedron
• The 0-1 knapsack problem with a single continuous variable
• The Continuous Mixing Polyhedron
• Tight second stage formulations in two-stage stochastic mixed integer programs
• Two-step MIR inequalities for mixed integer programs
• Valid inequalities based on simple mixed-integer sets

Cited in

(7)

• 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
• Facets of a mixed-integer bilinear covering set with bounds on variables
• 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 multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem

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

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