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-1zbMATH Open1327.90115OpenAlexW2105837115MaRDI QIDQ896282FDOQ896282
Manish Kumar 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
cutting planesmixed integer programming\(n\)-step cycle inequalities\(n\)-step MIRcontinuous multi-mixingmulti-module capacitated lot-sizing with/without backlogging
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- Valid inequalities based on simple mixed-integer sets
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Mixing mixed-integer inequalities
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem
- 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
- The Continuous Mixing Polyhedron
- Two-step MIR inequalities for mixed integer programs
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow
Cited In (9)
- Discrete multi-module capacitated lot-sizing problems with multiple items
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables
- Valid inequalities and facets for multi‐module survivable network design problem
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896282)
