n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem

DOI10.1007/978-3-319-07557-0_9zbMath1418.90172OpenAlexW2178011466MaRDI QIDQ5418988

Manish Bansal, Kiavash Kianfar

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07557-0_9

zbMATH Keywords

\(n\)-step cycle inequalities\(n\)-step MIRmulti-module capacitated lot-sizing with backloggingcontinuous \(n\)-mixing

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (5)

Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets ⋮ \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing 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 ⋮ Facets for continuous multi-mixing set with general coefficients and bounded integer variables

This page was built for publication: n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem