Relaxations for two-level multi-item lot-sizing problems
From MaRDI portal
Publication:403668
DOI10.1007/s10107-013-0702-8zbMath1319.90058OpenAlexW2155554047MaRDI QIDQ403668
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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)
Related Items
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, Predictive Search for Capacitated Multi-Item Lot Sizing Problems, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Multiechelon Lot Sizing: New Complexities and Inequalities, Facets for single module and multi-module capacitated lot-sizing problems without backlogging, An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels, Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case, Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Single item lot-sizing with non-decreasing capacities
- Uncapacitated two-level lot-sizing
- Uncapacitated lot sizing with backlogging: the convex hull
- Packing and covering a tree by subtrees
- Lot-size models with backlogging: Strong reformulations and cutting planes
- On the convex hull of the union of certain polyhedra
- Computational complexity of uncapacitated multi-echelon production planning problems
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Approximate extended formulations
- Dynamic Version of the Economic Lot Size Model
- Economic Lot-Sizing for Integrated Production and Transportation
- Integrated Lot Sizing in Serial Supply Chains with Production Capacities
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
- Network Formulations of Mixed-Integer Programs
- Uncapacitated lot-sizing: The convex hull of solutions
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Computational Complexity of the Capacitated Lot Size Problem
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Graph Theory and Integer Programming
- Improved Algorithms for Economic Lot Size Problems
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
- Uncapacitated lot-sizing with buying, sales and backlogging
- Production Planning by Mixed Integer Programming
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Mixing mixed-integer inequalities
