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

This publication has 10 references indexed in Scilit:

• Solving Mixed Integer Programming Problems Using Automatic Reformulation
  Operations Research, 1987
• Packing and covering a tree by subtrees
  Combinatorica, 1986
• Valid inequalities and separation for uncapacitated fixed charge networks
  Operations Research Letters, 1985
• A new polynomial-time algorithm for linear programming
  Combinatorica, 1984
• Strong Formulations for Multi-Item Capacitated Lot Sizing
  Management Science, 1984
• A heuristic solution procedure for the multi‐item, single‐level, limited capacity, lot‐sizing problem
  Journal of Operations Management, 1981
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• Implicit representation of variable upper bounds in linear programming
  Published by Springer Nature ,1975
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
  Management Science, 1969
• Minimum Concave Cost Flows in Certain Networks
  Management Science, 1968