Multi-item capacitated lot-sizing by a cross decomposition based algorithm
From MaRDI portal
Publication:1339158
DOI10.1007/BF02085658zbMath0812.90041MaRDI QIDQ1339158
Kleber X. S. de Souza, Vinicius Amaral Armentano
Publication date: 15 May 1995
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items
Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints, A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
Cites Work
- Large-scale mixed integer programming: Benders-type heuristics
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Partitioning procedures for solving mixed-variables programming problems
- Primal-dual approach to the single level capacitated lot-sizing problem
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
- Deterministic Production Planning: Algorithms and Complexity
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Multicommodity Distribution System Design by Benders Decomposition
- Cross decomposition for mixed integer programming
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Integer Programming by Implicit Enumeration and Balas’ Method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
