Relaxations for two-level multi-item lot-sizing problems
DOI10.1007/S10107-013-0702-8zbMATH Open1319.90058OpenAlexW2155554047MaRDI QIDQ403668FDOQ403668
Laurence A. Wolsey, Mathieu Van Vyve, Hande Yaman
Publication date: 29 August 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/12930
Recommendations
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)
Cites Work
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
- Production Planning by Mixed Integer Programming
- Graph Theory and Integer Programming
- Computational complexity of uncapacitated multi-echelon production planning problems
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Uncapacitated two-level lot-sizing
- Dynamic version of the economic lot size model
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Mixing mixed-integer inequalities
- Title not available (Why is that?)
- Improved Algorithms for Economic Lot Size Problems
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Integrated Lot Sizing in Serial Supply Chains with Production Capacities
- Computational Complexity of the Capacitated Lot Size Problem
- Uncapacitated lot sizing with backlogging: the convex hull
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Uncapacitated lot-sizing: The convex hull of solutions
- Title not available (Why is that?)
- Packing and covering a tree by subtrees
- On the convex hull of the union of certain polyhedra
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- Approximate extended formulations
- Economic Lot-Sizing for Integrated Production and Transportation
- Network Formulations of Mixed-Integer Programs
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Uncapacitated lot-sizing with buying, sales and backlogging
- Single item lot-sizing with non-decreasing capacities
Cited In (10)
- Predictive Search for Capacitated Multi-Item Lot Sizing Problems
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
- Multiechelon Lot Sizing: New Complexities and Inequalities
- An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels
- Algorithms for the two-stage production-capacitated lot-sizing problem
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
Uses Software
This page was built for publication: Relaxations for two-level multi-item lot-sizing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403668)
