Lagrangean decomposition: A model yielding stronger lagrangean bounds
暂无分享,去创建一个
[1] Fred Glover,et al. Technical Note - Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks , 1980, Oper. Res..
[2] A. M. Geoffrion. Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .
[3] Harvey J. Greenberg,et al. Surrogate Mathematical Programming , 1970, Oper. Res..
[4] Donald Erlenkotter,et al. A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..
[5] Martin Dyer. Calculating surrogate constraints , 1980, Math. Program..
[6] R. E. Marsten,et al. A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem , 1980 .
[7] M. Fisher,et al. A multiplier adjustment method for the generalized assignment problem , 1986 .
[8] András Frank,et al. A Weighted Matroid Intersection Algorithm , 1981, J. Algorithms.
[9] Richard T. Wong,et al. A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..
[10] Ronald L. Rardin,et al. Some relationships between lagrangian and surrogate duality in integer programming , 1979, Math. Program..
[11] Hasan Pirkul,et al. Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality , 1985, Math. Program..
[12] Fred W. Glover,et al. Layering strategies for creating exploitable structure in linear and integer programs , 1988, Math. Program..
[13] M. Minoux,et al. Plus court chemin avec contraintes : Algorithmes et applications , 1975 .
[14] Gabriel Y. Handler,et al. A dual algorithm for the constrained shortest path problem , 1980, Networks.
[15] J. Krarup,et al. Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .