Uncapacitated lot sizing with backlogging: the convex hull
From MaRDI portal
Publication:1016115
DOI10.1007/s10107-007-0186-5zbMath1221.90068OpenAlexW2145130933MaRDI QIDQ1016115
Publication date: 4 May 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.4196
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales, A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders, Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms, Two-stage stochastic lot-sizing problem under cost uncertainty, Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs, New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem, Relaxations for two-level multi-item lot-sizing problems, A computational analysis of lower bounds for big bucket production planning problems, Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups, Single-item dynamic lot-sizing problems: an updated survey, A polyhedral study of the static probabilistic lot-sizing problem, Multiechelon Lot Sizing: New Complexities and Inequalities, Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case, A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems, Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution, An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging, Robust formulations for economic lot-sizing problem with remanufacturing
Cites Work
- Unnamed Item
- Unnamed Item
- Valid inequalities and separation for uncapacitated fixed charge networks
- Lot-size models with backlogging: Strong reformulations and cutting planes
- A polyhedral approach to a production planning problem
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- Approximate extended formulations
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Production Planning by Mixed Integer Programming
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
