A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
DOI10.1007/S10472-013-9339-9zbMATH Open1291.90323OpenAlexW2094587300MaRDI QIDQ2248555FDOQ2248555
Authors: Marco Caserta, Stefan Voß 
Publication date: 26 June 2014
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-013-9339-9
Recommendations
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
- An improved heuristic for the capacitated lot-sizing problem
Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05) Production models (90B30)
Cites Work
- Title not available (Why is that?)
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Branch-and-price: Column generation for solving huge integer programs
- Perishable Inventory Theory: A Review
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matheuristics
- Dynamic version of the economic lot size model
- Decomposition Principle for Linear Programs
- The Steiner tree problem with hop constraints
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Modeling industrial lot sizing problems: a review
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
- Title not available (Why is that?)
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
Cited In (8)
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- A dynamic programming-based matheuristic for the dynamic berth allocation problem
- A matheuristic approach for solving the 2-connected dominating set problem
- Integrating deterioration and lifetime constraints in production and supply chain planning: a survey
- Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
- Parameter tuning for local-search-based matheuristic methods
Uses Software
This page was built for publication: A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248555)
