Back to search

Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation

Data up to Jan 2025

Published2002
Citations130
References53

Total Citations Per Year

Abstract

References (53)

Dynamic Version of the Economic Lot Size Model

2004 • 2,136 citations

Dynamic Version of the Economic Lot Size Model

1958 • 1,969 citations

Optimal Policies for a Multi-Echelon Inventory Problem

2004 • 1,218 citations

Optimal Policies for a Multi-Echelon Inventory Problem

1960 • 1,193 citations

Computational Complexity of the Capacitated Lot Size Problem

1982 • 527 citations

A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach

1969 • 523 citations

Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case

1992 • 468 citations

Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition

1987 • 394 citations

A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time

1991 • 379 citations

Improved Algorithms for Economic Lot Size Problems

1993 • 364 citations

Deterministic Production Planning with Concave Costs and Capacity Constraints

1971 • 305 citations

The discrete lot-sizing and scheduling problem

1990 • 269 citations

Valid Linear Inequalities for Fixed Charge Problems

1985 • 243 citations

Bounded Production and Inventory Models with Piecewise Concave Costs

1973 • 193 citations

Uncapacitated lot-sizing: The convex hull of solutions

1984 • 191 citations

Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs

2001 • 176 citations

bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems

2000 • 171 citations

Mixing mixed-integer inequalities

2001 • 167 citations

Batching decisions: structure and models

1994 • 164 citations

The Deterministic Dynamic Product Cycling Problem

1985 • 162 citations

An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities

1996 • 158 citations

Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems

1977 • 144 citations

Lot-Sizing with Constant Batches: Formulation and Valid Inequalities

1993 • 143 citations

Polyhedra for lot-sizing with Wagner—Whitin costs

1994 • 139 citations

Lot-size models with backlogging: Strong reformulations and cutting planes

1988 • 137 citations

The discrete lot-sizing and scheduling problem with sequence-dependent setup costs

1994 • 116 citations

Facets and algorithms for capacitated lot sizing

1989 • 115 citations

Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition

1987 • 99 citations

Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

2001 • 92 citations

Valid inequalities and separation for capacitated economic lot sizing

1988 • 77 citations

Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems

1993 • 72 citations

bc-opt: a branch-and-cut code for mixed integer programs

1999 • 71 citations

A cutting plane approach to capacitated lot-sizing with start-up costs

1996 • 64 citations

Packing and covering a tree by subtrees

1986 • 58 citations

The uncapacitated lot-sizing problem with sales and safety stocks

2001 • 57 citations

Lot-Sizing with Start-Up Times

1998 • 55 citations

Mathematical Programming Models and Formulations for Deterministic Production Planning Problems

2001 • 53 citations

Uncapacitated Lot-Sizing Problems with Start-Up Costs

1989 • 50 citations

Lower Bounds in Lot-Sizing Models: A Polyhedral Study

1998 • 43 citations

Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems

2003 • 41 citations

On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs

1997 • 37 citations

Algorithms and Reformulations for Lot-Sizing Problems

1995 • 36 citations

The single-item discrete lotsizing and scheduling problem: optimization by linear and dynamic programming

1994 • 33 citations

Algorithms and reformulations for lot sizing problems

1995 • 33 citations

Dynamic knapsack sets and capacitated lot-sizing

2003 • 30 citations

Lotsizing with backlogging and start-ups: the case of Wagner–Whitin costs

1999 • 29 citations

A linear description of the discrete lot-sizing and scheduling problem

1994 • 28 citations

Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs

1994 • 27 citations

Models and algorithms for single-item lot sizing problems

1991 • 17 citations

A polyhedral approach to the discrete lot-sizing and scheduling problem

1996 • 13 citations

Models and algorithms for single-item lot sizing problems

1991 • 7 citations

Tight MIP formulations for multi-item discrete lot-sizing problems

2003 • 5 citations

A class of strong valid inequalities for the discrete lot-sizing and scheduling problem

1992 • 2 citations

Cited By (0)

Loading...