Multi-item capacitated lot-sizing by a cross decomposition based algorithm
type: Item
instance of: scholarly article
title: Multi-item capacitated lot-sizing by a cross decomposition based algorithm
zbMATH Open document ID: 0812.90041
DOI: 10.1007/BF02085658
author: Kleber X. S. de Souza
author: Vinicius Amaral Armentano
published in: Annals of Operations Research
publication date: 1995-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 698927
zbMATH Keywords: setup time
zbMATH Keywords: multi-item capacitated lot-sizing
zbMATH Keywords: resource constraints
MaRDI profile type: Publication
cites work: Cross decomposition for mixed integer programming
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Q4178782
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Multilevel capacitated lotsizing complexity and LP-based heuristics
cites work: Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: Primal-dual approach to the single level capacitated lot-sizing problem
cites work: Capacitated lot-sizing and scheduling by Lagrangean relaxation
cites work: A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
cites work: A Cross Decomposition Algorithm for Capacitated Facility Location
cites work: Q3968758
cites work: A Deterministic Multi-Period Production Scheduling Model with Backlogging
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: Large-scale mixed integer programming: Benders-type heuristics
cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
cites work: Integer Programming by Implicit Enumeration and Balas’ Method
cites work: Q4133397
cites work: Q4105990
Recommended article: An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
Recommended article: Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
Recommended article: A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
Recommended article: Discrete multi-module capacitated lot-sizing problems with multiple items
Recommended article: Multi-item capacitated lot-sizing with demand uncertainty
Recommended article: Multi-item capacitated lot-sizing problems with setup times and pricing decisions
Recommended article: Strong Formulations for Multi-Item Capacitated Lot Sizing
Recommended article: The multi-item capacitated lot-sizing problem with setup times and shortage costs
Recommended article: Analysis of relaxations for the multi-item capacitated lot-sizing problem
Recommended article: A hybrid optimization approach for multi-level capacitated lot-sizing problems
description: scientific article; zbMATH DE number 698927