LS-LIB: A Library of Tools for Solving Production Planning Problems
From MaRDI portal
Publication:2971615
DOI10.1007/978-3-540-76796-1_15zbMath1359.90004OpenAlexW1768234901MaRDI QIDQ2971615
Yves Pochet, Laurence A. Wolsey, Mathieu Van Vyve
Publication date: 7 April 2017
Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_15
Mixed integer programming (90C11) Production models (90B30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single item lot-sizing with non-decreasing capacities
- Lot-sizing on a tree
- Multi-item lot-sizing with joint set-up costs
- Valid inequalities for mixed 0-1 programs
- Packing and covering a tree by subtrees
- Valid inequalities and separation for capacitated economic lot sizing
- Lot-size models with backlogging: Strong reformulations and cutting planes
- A linear description of the discrete lot-sizing and scheduling problem
- A cutting plane approach to capacitated lot-sizing with start-up costs
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
- Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
- Local branching
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
- A study of the lot-sizing polytope
- Lot-sizing with production and delivery time windows
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- Approximate extended formulations
- Lower Bounds in Lot-Sizing Models: A Polyhedral Study
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Uncapacitated lot-sizing: The convex hull of solutions
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
- Valid Linear Inequalities for Fixed Charge Problems
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Production Planning by Mixed Integer Programming
- The Continuous Mixing Polyhedron
