论文信息 - The capacitated distribution and waste disposal problem. - 字舞流文

The capacitated distribution and waste disposal problem.

Marc Salomon | Luk N. Van Wassenhove | Jacqueline M. Bloemhof-Ruwaard | L. V. Wassenhove | J. Bloemhof-Ruwaard | M. Salomon

[1] P. S. Davis,et al. A branch‐bound algorithm for the capacitated facilities location problem , 1969 .

[2] B. M. Khumawala. An efficient heuristic procedure for the uncapacitated warehouse location problem , 1973 .

[3] Leon F. McGinnis,et al. Invited reviewLocational analysis , 1983 .

[4] Nicos Christofides,et al. Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem , 1983 .

[5] D. Tcha,et al. A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints , 1984 .

[6] Wolfgang Domschke,et al. ADD – heuristics' starting procedures for capacitated plant location models , 1985 .

[7] M. Guignard,et al. Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems , 1990 .

[8] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[9] G. Cornuéjols,et al. A comparison of heuristics and relaxations for the capacitated plant location problem , 1991 .

[10] Karen Aardal. On the Solution of One and Two-Level Capacitated Facility Location Problems by the Cutting Plane Approach , 1992 .

[11] L. V. Wassenhove,et al. On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures , 1994 .