Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
Network Flows: Theory, Algorithms, and Applications.
1994 • 8,288 citations
Network flows: Theory, algorithms and applications
1994 • 2,954 citations
Outline of an algorithm for integer solutions to linear programs
1958 • 1,369 citations
The discrete lot-sizing and scheduling problem
1990 • 269 citations
Convex separable optimization is not much harder than linear optimization
1990 • 237 citations
Mixing mixed-integer inequalities
2001 • 167 citations
Polyhedra for lot-sizing with Wagner—Whitin costs
1994 • 139 citations
The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
1994 • 116 citations
Tight formulations for some simple mixed integer programs and convex objective integer programs
2003 • 95 citations
On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
1997 • 37 citations
The single-item discrete lotsizing and scheduling problem: optimization by linear and dynamic programming
1994 • 33 citations
Diagnostic scheduling in finite-capacity production environments
1997 • 27 citations
A polyhedral approach to the discrete lot-sizing and scheduling problem
1996 • 13 citations