Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
From MaRDI portal
Publication:2960369
DOI10.1287/ijoc.2016.0712zbMath1355.90075OpenAlexW2460889553MaRDI QIDQ2960369
Andrew J. Miller, Kerem Akartunalı, Tao Wu, Ioannis Fragkos
Publication date: 8 February 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2016.0712
Related Items (16)
A supervised learning-driven heuristic for solving the facility location and production planning problem ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ 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 ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ A rolling-horizon approach for multi-period optimization ⋮ New construction heuristic for capacitated lot sizing problems ⋮ Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem ⋮ Multiechelon Lot Sizing: New Complexities and Inequalities ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Facets for single module and multi-module capacitated lot-sizing problems without backlogging ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
Uses Software
Cites Work
- Unnamed Item
- Relaxations for two-level multi-item lot-sizing problems
- On the exact separation of mixed integer knapsack cuts
- MIR closures of polyhedral sets
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- Lagrangean relaxation based heuristics for lot sizing with setup times
- A heuristic approach for big bucket multi-level production planning problems
- Multi-item lot-sizing with joint set-up costs
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- On the capacitated vehicle routing problem
- On the polyhedral structure of a multi-item production planning model with setup times
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Split closure and intersection cuts
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A study of the lot-sizing polytope
- A computational analysis of lower bounds for big bucket production planning problems
- Generalized intersection cuts and a new cut generating paradigm
- Local cuts for mixed-integer programming
- Exact solutions to linear programming problems
- Optimizing over the split closure
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Approximate extended formulations
- Dynamic Version of the Economic Lot Size Model
- A General Heuristic for Production Planning Problems
- Numerically Safe Gomory Mixed-Integer Cuts
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
- Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Optimizing over the First Chvàtal Closure
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Fenchel Cutting Planes for Integer Programs
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- On the Automatic Scaling of Matrices for Gaussian Elimination
- On disjunctive cuts for combinatorial optimization
This page was built for publication: Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
