ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
34
views
8
references
Top references
cited by
62
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,604
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
Author(s):
N. Christofides
,
A. Mingozzi
,
P. Toth
Publication date
Created:
December 1981
Publication date
(Print):
December 1981
Journal:
Mathematical Programming
Publisher:
Springer Nature
Read this article at
ScienceOpen
Publisher
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Path of Science
Most cited references
8
Record
: found
Abstract
: not found
Article
: not found
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
G Clarke
,
J W Wright
(1964)
0
comments
Cited
368
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On a routing problem
Richard Bellman
(1958)
0
comments
Cited
221
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The Traveling-Salesman Problem and Minimum Spanning Trees
Michael Held
,
Richard M Karp
(1970)
0
comments
Cited
141
times
– based on
0
reviews
Review now
Bookmark
All references
Author and article information
Journal
Title:
Mathematical Programming
Abbreviated Title:
Mathematical Programming
Publisher:
Springer Nature
ISSN (Print):
0025-5610
ISSN (Electronic):
1436-4646
Publication date Created:
December 1981
Publication date (Print):
December 1981
Volume
: 20
Issue
: 1
Pages
: 255-282
Article
DOI:
10.1007/BF01589353
SO-VID:
6a9126b9-b8f3-40c6-950e-8d618bb33360
Copyright ©
© 1981
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
2,604
Seismic source location using the shortest path method based on boundary discretisation scheme for microseismic monitoring in underground mines
Authors:
Y. DUAN
,
X. LUO
,
G. Si
…
Automated robust crop-row detection in maize fields based on position clustering algorithm and shortest path method
Authors:
Jun Zhou
,
Baoxing Gu
,
Yingjun Xiong
…
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Authors:
Marnix Jonker
,
A. Volgenant
See all similar
Cited by
59
Routing and scheduling of vehicles and crews
Authors:
Samuel Raff
Fifty Years of Vehicle Routing
Authors:
Gilbert Laporte
The pickup and delivery problem with time windows
Authors:
François Soumis
,
Yvan Dumas
,
Jacques Desrosiers
See all cited by
Most referenced authors
53
S. Lin
J. Wright
L. Miller
See all reference authors