Lot-size models with backlogging: Strong reformulations and cutting planes
暂无分享,去创建一个
[1] L. Schrage. Implicit representation of variable upper bounds in linear programming , 1975 .
[2] Laurence A. Wolsey,et al. Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..
[3] W. Zangwill. A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .
[4] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[5] G. D. Eppen,et al. Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..
[6] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[7] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[8] L. Wolsey,et al. Valid inequalities and separation for uncapacitated fixed charge networks , 1985 .
[9] L Van Wassenhove,et al. Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem , 1985 .
[10] Laurence A. Wolsey,et al. Strong Formulations for Multi-Item Capacitated Lot Sizing , 1984 .
[11] Laurence A. Wolsey,et al. Packing and covering a tree by subtrees , 1986, Comb..
[12] W. Zangwill. Minimum Concave Cost Flows in Certain Networks , 1968 .
[13] E. Silver,et al. A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem , 1981 .