Lot-sizing with fixed charges on stocks: the convex hull
From MaRDI portal
Publication:2386201
DOI10.1016/J.DISOPT.2004.07.001zbMATH Open1087.90013OpenAlexW2049428511MaRDI QIDQ2386201FDOQ2386201
Authors: Yanyan Li 
Publication date: 22 August 2005
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2004.07.001
Recommendations
- A note on ``Lot-sizing with fixed charges on stocks: the convex hull
- Uncapacitated lot-sizing: The convex hull of solutions
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Lot-sizing with stock upper bounds and fixed charges
- Erratum: Lot-sizing with stock upper bounds and fixed charges
- The multiscenario lot size problem with concave costs.
- Uncapacitated lot sizing with backlogging: the convex hull
- The stochastic lot sizing problem with piecewise linear concave ordering costs
- A polynomial time algorithm for convex cost lot-sizing problems
- A study of the lot-sizing polytope
Cites Work
- Network flows. Theory, algorithms, and applications.
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Dynamic version of the economic lot size model
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Title not available (Why is that?)
- Improved Algorithms for Economic Lot Size Problems
- Title not available (Why is that?)
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Uncapacitated lot-sizing: The convex hull of solutions
- Packing and covering a tree by subtrees
- The uncapacitated lot-sizing problem with sales and safety stocks
- The Deterministic Dynamic Product Cycling Problem
Cited In (14)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
- Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem
- A note on ``Lot-sizing with fixed charges on stocks: the convex hull
- Single-item dynamic lot-sizing problems: an updated survey
- Modeling industrial lot sizing problems: a review
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- The uncapacitated lot-sizing problem with sales and safety stocks
- Uncapacitated lot-sizing: The convex hull of solutions
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Uncapacitated lot sizing with backlogging: the convex hull
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- Lot-sizing with stock upper bounds and fixed charges
- Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
This page was built for publication: Lot-sizing with fixed charges on stocks: the convex hull
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386201)
