Parallel branch and cut for capacitated vehicle routing-Reference-Cited by-同舟云学术

Parallel branch and cut for capacitated vehicle routing

Published:2003-05 Issue:5 Volume:29 Page:607-629
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Ralphs T.K.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference57 articles.

1. Set partitioning approach to vehicle routing;Agarwal;Networks,1989

2. D. Applegate, R. Bixby, V. Chvátal, W. Cook, On the solution of traveling salesman problems, Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung, International Congress of Mathematicians (1998) 645

3. D. Applegate, R. Bixby, V. Chvátal, W. Cook, CONCORDE TSP Solver, Available from www.keck.caam.rice.edu/concorde.html

4. J.R. Araque, L. Hall, T. Magnanti, Capacitated trees, capacitated routing and associated polyhedra, Discussion Paper 9061, CORE, Louvain La Nueve, 1990

5. A branch-and-cut algorithm for vehicle routing problems;Araque;Annals of Operations Research,1994

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES;Advances and Applications in Discrete Mathematics;2022-11-18

2. On optimal coverage of a tree with multiple robots;European Journal of Operational Research;2020-09

3. Equilibrium: an elasticity controller for parallel tree search in the cloud;The Journal of Supercomputing;2020-02-20

4. GPU‐based branch‐and‐bound method to solve large 0‐1 knapsack problems with data‐centric strategies;Concurrency and Computation: Practice and Experience;2018-09-27

5. Quality-aware UAV coverage and path planning in geometrically complex environments;Ad Hoc Networks;2018-05