Analysis of relaxations for the multi-item capacitated lot-sizing problem
- 1 December 1990
- journal article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 26 (1-4), 29-72
- https://doi.org/10.1007/bf02248584
Abstract
No abstract availableKeywords
This publication has 45 references indexed in Scilit:
- Multi Item Single Level Capacitated Dynamic Lotsizing Heuristics: A Computational Comparison (Part I: Static Case)IIE Transactions, 1986
- Network-based optimization algorithms for the capacitated multi-item lot sizing problemComputers & Industrial Engineering, 1985
- Multicommodity Network Problems: Applications and ComputationsIIE Transactions, 1984
- Projected Newton methods and optimization of multicommodity flowsIEEE Transactions on Automatic Control, 1983
- A heuristic solution procedure for the multi‐item, single‐level, limited capacity, lot‐sizing problemJournal of Operations Management, 1981
- HEURISTIC LOT‐SIZING PERFORMANCE IN A ROLLING‐SCHEDULE ENVIRONMENT*Decision Sciences, 1980
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation AlgorithmJournal of the ACM, 1973
- Generalized upper bounding techniquesJournal of Computer and System Sciences, 1967
- An algorithm for quadratic programmingNaval Research Logistics Quarterly, 1956