A Greedy Algorithm for Capacitated Lot-Sizing Problems

DOI10.1080/0233193031000079801zbMath1047.90034OpenAlexW1971764678MaRDI QIDQ4430673

Michael Höding, Alexander Zaporozhets, Eberhard Girlich, Sergei Chubanov

Publication date: 12 October 2003

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0233193031000079801

zbMATH Keywords

greedy algorithmpolymatroidlot-sizing problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (1)

A linear-time algorithm for finding optimal vehicle refueling policies

Cites Work

• Submodular functions and optimization
• Computational Complexity of the Capacitated Lot Size Problem
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Unnamed Item

This page was built for publication: A Greedy Algorithm for Capacitated Lot-Sizing Problems