Multi-item capacitated lot-sizing by a cross decomposition based algorithm
From MaRDI portal
Recommendations
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
- Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- Discrete multi-module capacitated lot-sizing problems with multiple items
- Multi-item capacitated lot-sizing with demand uncertainty
- Multi-item capacitated lot-sizing problems with setup times and pricing decisions
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
Cites work
- scientific article; zbMATH DE number 3791941 (Why is no real title available?)
- scientific article; zbMATH DE number 3529629 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Cross decomposition for mixed integer programming
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Deterministic Production Planning: Algorithms and Complexity
- Integer Programming by Implicit Enumeration and Balas’ Method
- Large-scale mixed integer programming: Benders-type heuristics
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
- Multicommodity Distribution System Design by Benders Decomposition
- 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
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
Cited in
(5)- A Lagrangean relaxation approach for capacitated lot sizing problem with setup times
- Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Production and inventory management under multiple resource constraints
This page was built for publication: Multi-item capacitated lot-sizing by a cross decomposition based algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339158)
