Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
105
Voted
AAIM
2009
Springer
91
views
Algorithms
»
more
AAIM 2009
»
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
15 years 9 months ago
Download
www.informatik.uni-kiel.de
Changxing Dong, Gerold Jäger, Dirk Richter, P
Real-time Traffic
AAIM 2009
|
Algorithms
|
claim paper
Related Content
»
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
more »
Post Info
More Details (n/a)
Added
25 May 2010
Updated
25 May 2010
Type
Conference
Year
2009
Where
AAIM
Authors
Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision