Reference70 articles.
1. Altinkemer, K., and B. Gavish [1991]: Parallel savings based heuristics for the delivery problem; Operations Research 39, 456–469.
2. Applegate, D., and W. Cook [1993]: Solving large-scale matching problems; in: Network Flows and Matching: First DIMACS Implementation Challenge (D.S. Johnson and C.C. McGeoch, editors), American Mathematical Society, 557–576.
3. Bachem, A., and M. Malich [1993]: The simulated trading heuristic for solving vehicle routing problems; Operations Research 93, 16–19.
4. Balinski, M.L. [1972]: Establishing the matching polytope; J. Comb. Theory, Ser. B 13, 1–13.
5. Ball, M.O., L.D. Bodin, and R. Dial [1983]: A matching based heuristic for scheduling mass transit crews and vehicles; Transportation Science 17, 4–31.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献