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
4
views
1
references
Top references
cited by
35
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,589
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
State-space relaxation procedures for the computation of bounds to routing problems
Author(s):
Nicos Christofides
,
A. Mingozzi
,
P. Toth
Publication date
Created:
22 1981
Publication date
(Print):
22 1981
Journal:
Networks
Publisher:
Wiley-Blackwell
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
Cascading Disasters
Most cited references
1
Record
: found
Abstract
: not found
Book Chapter
: not found
Lagrangean relaxation for integer programming
A. Geoffrion
(1974)
0
comments
Cited
127
times
– based on
0
reviews
Bookmark
All references
Author and article information
Journal
Title:
Networks
Abbreviated Title:
Networks
Publisher:
Wiley-Blackwell
ISSN (Print):
00283045
ISSN (Electronic):
10970037
Publication date Created:
22 1981
Publication date (Print):
22 1981
Volume
: 11
Issue
: 2
Pages
: 145-164
Article
DOI:
10.1002/net.3230110207
SO-VID:
c15881f7-7432-4327-845f-6ec4ef959ff2
Copyright ©
© 1981
License:
http://doi.wiley.com/10.1002/tdm_license_1.1
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
1,589
Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening
Authors:
Gabriel Ponte
,
Marcia Fampa
,
Jon Lee
A Bounding Quantifier
Authors:
Mikołaj Bojanczyk
Tuning SAT Checkers for Bounded Model Checking
Authors:
Ofer Shtrichman
See all similar
Cited by
33
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Authors:
Ibrahim Hassan Osman
Routing and scheduling of vehicles and crews
Authors:
Samuel Raff
Fifty Years of Vehicle Routing
Authors:
Gilbert Laporte
See all cited by
Most referenced authors
5
Arthur M. Geoffrion
A Geoffrion
A.M. Geoffrion
See all reference authors