\(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem

DOI10.1007/s10107-015-0906-1zbMath1327.90115OpenAlexW2105837115MaRDI QIDQ896282

Manish Bansal, Kiavash Kianfar

Publication date: 9 December 2015

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-015-0906-1

zbMATH Keywords

mixed integer programmingcutting planes\(n\)-step cycle inequalities\(n\)-step MIRcontinuous multi-mixingmulti-module capacitated lot-sizing with/without backlogging

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (9)

Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets ⋮ Discrete multi-module capacitated lot-sizing problems with multiple items ⋮ Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs ⋮ Valid inequalities and facets for multi‐module survivable network design problem ⋮ 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 ⋮ Facets for continuous multi-mixing set with general coefficients and bounded integer variables ⋮ On solving two-stage distributionally robust disjunctive programs with a general ambiguity set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mingling: mixed-integer rounding with bounds
• Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
• Negative-cycle detection algorithms
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• 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
• Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
• Two-Step MIR Inequalities for Mixed Integer Programs
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II
• The Continuous Mixing Polyhedron
• Mixing mixed-integer inequalities

This page was built for publication: \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem