Dynamic knapsack sets and capacitated lot-sizing
From MaRDI portal
Publication:1411629
DOI10.1007/s10107-002-0341-yzbMath1030.90102OpenAlexW2113912706MaRDI QIDQ1411629
Laurence A. Wolsey, Hugues Marchand, Marko Loparic
Publication date: 29 October 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0341-y
Related Items (12)
Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Partial objective inequalities for the multi-item capacitated lot-sizing problem ⋮ Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ A polyhedral study of lot-sizing with supplier selection ⋮ A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems ⋮ Single item lot-sizing problem for a warm/cold process with immediate lost sales ⋮ Sequential pairing of mixed integer inequalities ⋮ A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times ⋮ Single item lot sizing problems ⋮ A polyhedral approach to least cost influence maximization in social networks ⋮ Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
Uses Software
This page was built for publication: Dynamic knapsack sets and capacitated lot-sizing
