Reformulation by discretization: application to economic lot sizing
From MaRDI portal
Publication:2465954
DOI10.1016/j.orl.2006.10.009zbMath1149.90106OpenAlexW2095474805MaRDI QIDQ2465954
Miguel Fragoso Constantino, Luís Gouveia
Publication date: 11 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2006.10.009
Related Items (4)
Extended formulations for the cardinality constrained subtree of a tree problem ⋮ Enhancing discretized formulations: the knapsack reformulation and the star reformulation ⋮ MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem ⋮ Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs
Cites Work
- Unnamed Item
- Unnamed Item
- A classification of formulations for the (time-dependent) traveling salesman problem
- On the capacitated concentrator location problem: a reformulation by discretization
- Dynamic Version of the Economic Lot Size Model
- Uncapacitated lot-sizing: The convex hull of solutions
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Improved Algorithms for Economic Lot Size Problems
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
This page was built for publication: Reformulation by discretization: application to economic lot sizing
