A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (original) (raw)
Related papers
Analysis of bounds for a capacitated single-item lot-sizing problem
Computers & Operations Research, 2007
A global constraint for the capacitated single-item lot-sizing problem
ArXiv, 2019
A note on solving the concave cost dynamic lot-sizing problem in almost linear time
Journal of Operations Management, 1989
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
Operations Research, 2008
Lecture Notes in Computer Science, 2007
Dynamic-programming-based inequalities for the capacitated lot-sizing problem
IIE Transactions, 2010
Mathematics of Operations Research, 2008
International Journal of Production Economics, 2009
Polynomial cases of the economic lot sizing problem with cost discounts
European Journal of Operational Research, 2014
Hybrid Formulation of the Multi-Item Capacitated Dynamic Lot Sizing Problem
American Journal of Operations Research, 2015
Facets and algorithms for capacitated lot sizing
Mathematical Programming, 1989
Single item lot-sizing with non-decreasing capacities
Mathematical Programming, 2010
2021
Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
European Journal of Operational Research, 2009
An algorithm for lot sizing with inventory bounds and fixed costs
Operations Research Letters, 2008
Computers & Operations Research, 2011
Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
Naval Research Logistics (NRL), 2012
2013
A polyhedral study of the single-item lot-sizing problem with continuous start-up costs
Electronic Notes in Discrete Mathematics, 2011
Uncapacitated lot sizing with backlogging: the convex hull
Mathematical Programming, 2009
Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem
Operations Research, 2013