Facets for single module and multi-module capacitated lot-sizing problems without backlogging

DOI10.1016/j.dam.2018.07.029zbMath1436.90089OpenAlexW2893734128WikidataQ129246162 ScholiaQ129246162MaRDI QIDQ1727732

Manish Bansal

Publication date: 20 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.07.029

zbMATH Keywords

mixed integer programmingmixingcutting planeslot-sizingmulti-module capacitiessequential pairing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Combinatorial optimization (90C27)

Related Items (2)

Discrete multi-module capacitated lot-sizing problems with multiple items ⋮ Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxations for two-level multi-item lot-sizing problems
• \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
• Facets for continuous multi-mixing set with general coefficients and bounded integer variables
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• 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
• Sequential pairing of mixed integer inequalities
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Valid inequalities based on simple mixed-integer sets
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
• A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
• Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
• Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs
• Cutting Planes for Multistage Stochastic Integer Programs
• Shortest paths, single origin‐destination network design, and associated polyhedra
• n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem
• Production Planning by Mixed Integer Programming
• The Continuous Mixing Polyhedron
• Mixing mixed-integer inequalities

This page was built for publication: Facets for single module and multi-module capacitated lot-sizing problems without backlogging