Lot-size models with backlogging: Strong reformulations and cutting planes
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
Polynomial algorithms in linear programming
1980 • 2,063 citations
The ellipsoid method and its consequences in combinatorial optimization
1981 • 2,062 citations
A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
1969 • 523 citations
Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
1987 • 394 citations
Minimum Concave Cost Flows in Certain Networks
1968 • 308 citations
Solving Mixed Integer Programming Problems Using Automatic Reformulation
1987 • 270 citations
Strong Formulations for Multi-Item Capacitated Lot Sizing
1984 • 261 citations
A heuristic solution procedure for the multi‐item, single‐level, limited capacity, lot‐sizing problem
1981 • 250 citations
Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem: A Heuristic Implementation
1985 • 145 citations
Implicit representation of variable upper bounds in linear programming
1975 • 117 citations
Packing and covering a tree by subtrees
1986 • 58 citations
Valid inequalities and separation for uncapacitated fixed charge networks
1985 • 44 citations