scientific article; zbMATH DE number 1560348

MaRDI QIDQ4527200zbMATH OpenFDO

Authors C. Trouiller, Jean-Philippe Vial, Olivier du Merle, Jean-Louis Goffin

Publication date 30 July 2002

Mathematics Subject Classification ID

Production models (90B30) Combinatorial optimization (90C27) Interior-point methods (90C51) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
• Primal-dual approach to the single level capacitated lot-sizing problem
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing

Cited in

(10)

• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
• A Lagrangian heuristic for capacitated single item lot sizing problems
• Single item lot sizing problems
• A new algorithm of the CSLLSP in CIMS
• Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
• Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
• A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Analysis of relaxations for the multi-item capacitated lot-sizing problem

Describes a project that uses

Uses Software

• ACCPM

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527200)