The traveling salesman: computational solutions for TSP applications

This book is devoted to the famous traveling salesman problem (TSP), which is the task of finding a route of shortest possible length through a given set of cities. The TSP attracts interest from several scientific communities and from numerous application areas. First the theoretical prerequisites...

Full description

Saved in:
Bibliographic Details
Main Author: Reinelt, Gerhard (Author)
Format: Book/Monograph
Language:English
Published: Berlin, Heidelberg Springer-Verlag Berlin Heidelberg 1994
Series:Lecture notes in computer science 840
In: Lecture notes in computer science (840)

DOI:10.1007/3-540-48661-5
Subjects:
Online Access:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1007/3-540-48661-5
Resolving-System, lizenzpflichtig, Volltext: http://dx.doi.org/10.1007/3-540-48661-5
Cover: https://swbplus.bsz-bw.de/bsz322907187cov.jpg
Inhaltsverzeichnis: https://swbplus.bsz-bw.de/bsz041022238inh.htm
Verlag, Zentralblatt MATH, Inhaltstext: https://zbmath.org/?q=an:0825.90720
Get full text
Author Notes:by Gerhard Reinelt

MARC

LEADER 00000cam a22000002c 4500
001 1649309309
003 DE-627
005 20250612123439.0
007 cr uuu---uuuuu
008 100510s1994 gw |||||o 00| ||eng c
020 |a 9783540486619  |9 978-3-540-48661-9 
024 7 |a 10.1007/3-540-48661-5  |2 doi 
035 |a (DE-627)1649309309 
035 |a (DE-576)322907187 
035 |a (DE-599)BSZ322907187 
035 |a (OCoLC)845439962 
035 |a (OCoLC)699834707 
035 |a (DE-601)NLM003694046 
035 |a (DE-He213)978-3-540-48661-9 
035 |a (DE-627-1)04049215X 
035 |a (ZBM)0825.90720 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
044 |c XA-DE-BE 
050 0 |a T385 
050 0 |a T57.78 
072 7 |a UML  |2 bicssc 
072 7 |a COM012000  |2 bisacsh 
082 0 |a 006.6  |2 23 
082 0 |a 511/.5 
084 |a 28  |2 sdnb 
084 |a 27  |2 sdnb 
084 |a 28  |2 sdnb 
084 |a 17  |a 28  |2 sdnb 
084 |a SK 890  |2 rvk  |0 (DE-625)rvk/143267: 
084 |a *90C27  |2 msc 
084 |a 90-02  |2 msc 
084 |a 31.12  |2 bkl 
084 |a 54.10  |2 bkl 
084 |a 54.73  |2 bkl 
100 1 |a Reinelt, Gerhard  |0 (DE-588)101987113X  |0 (DE-627)691042861  |0 (DE-576)358936187  |4 aut 
245 1 4 |a The traveling salesman  |b computational solutions for TSP applications  |c by Gerhard Reinelt 
264 1 |a Berlin, Heidelberg  |b Springer-Verlag Berlin Heidelberg  |c 1994 
300 |a Online-Ressource 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
490 1 |a Lecture Notes in Computer Science  |v 840 
490 0 |a SpringerLink  |a Bücher 
500 |a Literaturverz. S. [214] - 221 
520 |a This book is devoted to the famous traveling salesman problem (TSP), which is the task of finding a route of shortest possible length through a given set of cities. The TSP attracts interest from several scientific communities and from numerous application areas. First the theoretical prerequisites are summarized. Then the emphasis shifts to computational solutions for practical TSP applications. Detailed computational experiments are used to show how to find good or acceptable routes for large problem instances in reasonable time. In total, this book meets a tremendous professional need for effective algorithms; it is the most comprehensive and up-to-date survey available on heuristic approaches to TSP solving 
650 0 |a Engineering 
650 0 |a Computer Science 
650 0 |a Computer science 
650 0 |a Combinatorics 
650 0 |a Management information systems 
650 0 |a Operations research 
650 0 |a Business information services. 
650 0 |a Dynamics. 
650 0 |a Nonlinear theories. 
650 0 |a Discrete mathematics. 
650 0 |a Algorithms 
650 0 |a Computer graphics 
653 0 |a Traveling-salesman problem 
653 0 |a Heuristic programming 
653 0 |a Algorithms 
689 0 0 |d s  |0 (DE-588)4185966-2  |0 (DE-627)104475307  |0 (DE-576)210036079  |a Travelling-salesman-Problem  |2 gnd 
689 0 |5 DE-101 
689 1 0 |d s  |0 (DE-588)4185966-2  |0 (DE-627)104475307  |0 (DE-576)210036079  |a Travelling-salesman-Problem  |2 gnd 
689 1 |5 (DE-627) 
689 2 0 |d s  |0 (DE-588)4185966-2  |0 (DE-627)104475307  |0 (DE-576)210036079  |a Travelling-salesman-Problem  |2 gnd 
689 2 |5 (DE-627) 
776 1 |z 9783540583349 
776 0 8 |i Buchausg. u.d.T.  |a Reinelt, Gerhard  |t The traveling salesman  |d Berlin : Springer, 1994  |h VIII, 223 S.  |w (DE-627)272035386  |w (DE-576)041022238  |z 3540583343  |z 0387583343 
830 0 |a Lecture notes in computer science  |v 840  |9 840  |w (DE-627)316228877  |w (DE-576)093890923  |w (DE-600)2018930-8  |x 1611-3349  |7 am 
856 4 0 |u https://doi.org/10.1007/3-540-48661-5  |m X:SPRINGER  |x Verlag  |z lizenzpflichtig  |3 Volltext 
856 4 0 |u http://dx.doi.org/10.1007/3-540-48661-5  |x Resolving-System  |z lizenzpflichtig  |3 Volltext 
856 4 2 |u https://swbplus.bsz-bw.de/bsz322907187cov.jpg  |m V:DE-576  |m X:springer  |q image/jpeg  |v 20150317120243  |3 Cover 
856 4 2 |u https://swbplus.bsz-bw.de/bsz041022238inh.htm  |m V:DE-576  |v 2005-06-08  |3 Inhaltsverzeichnis 
856 4 2 |u https://zbmath.org/?q=an:0825.90720  |m B:ZBM  |v 2021-04-12  |x Verlag  |y Zentralblatt MATH  |3 Inhaltstext 
889 |w (DE-576)9332909342 
889 |w (DE-627)749154268 
889 |w (DE-627)332909344 
912 |a ZDB-2-LNC  |b 1994 
912 |a ZDB-2-SCS  |b 1994 
912 |a ZDB-2-BAE  |b 1994 
912 |a ZDB-2-SXCS  |b 1994 
912 |a ZDB-2-SEB  |b 1994 
912 |a GBV-SPRINGER-LNCS 
912 |a ZDB-1-SLN 
935 |h GBV  |i ExPruef 
936 r v |a SK 890  |b Ganzzahlige und kombinatorische Optimierung, Graphentheorie  |k Mathematik  |k Monografien  |k Ganzzahlige und kombinatorische Optimierung, Graphentheorie  |0 (DE-627)1271487969  |0 (DE-625)rvk/143267:  |0 (DE-576)201487969 
936 r u |a SS 4800  |b Lecture notes in computer science  |k Lecture notes in computer science  |0 (DE-627)1271461242  |0 (DE-625)rvk/143528:  |0 (DE-576)201461242  |z Ungueltig 
936 b k |a 31.12  |j Kombinatorik  |j Graphentheorie  |q SEPA  |0 (DE-627)106418963 
936 b k |a 54.10  |j Theoretische Informatik  |q SEPA  |0 (DE-627)106418815 
936 b k |a 54.73  |j Computergraphik  |q SEPA  |0 (DE-627)106418920 
951 |a BO 
990 |a Travelling-salesman-Problem 
990 |a Travelling-salesman-Problem 
990 |a Travelling-salesman-Problem 
992 |a 20120628 
993 |a Book 
998 |g 101987113X  |a Reinelt, Gerhard  |m 101987113X:Reinelt, Gerhard  |d 110000  |d 110300  |e 110000PR101987113X  |e 110300PR101987113X  |k 0/110000/  |k 1/110000/110300/  |p 1  |x j  |y j 
999 |a KXP-PPN1649309309  |e 3333020165 
BIB |a Y 
JSO |a {"type":{"media":"Online-Ressource","bibl":"book"},"note":["Literaturverz. S. [214] - 221"],"physDesc":[{"extent":"Online-Ressource"}],"recId":"1649309309","language":["eng"],"relMultPart":[{"dispAlt":"Lecture notes in computer science","physDesc":[{"extent":"Online-Ressource"}],"origin":[{"publisherPlace":"Berlin ; Heidelberg","dateIssuedDisp":"1973-","dateIssuedKey":"1973","publisher":"Springer"}],"id":{"issn":["1611-3349"],"eki":["316228877"],"zdb":["2018930-8"]},"pubHistory":["1.1973 -"],"part":{"number_sort":["840"],"number":["840"]},"titleAlt":[{"title":"LNCS online"},{"title":"LNAI"},{"title":"Lecture notes in artificial intelligence"},{"title":"Lecture notes in bioinformatics"},{"title":"LNAI"},{"title":"LNBI"},{"title":"LNCS-LNAI"},{"title":"LNCS-LNBI"}],"note":["Gesehen am 28.02.20","Das Gesamtwerk gliedert sich in: Lecture notes in artificial intelligence; Lecture notes in bioinformatics"],"disp":"Lecture Notes in Computer Science","type":{"bibl":"serial","media":"Online-Ressource"},"recId":"316228877","language":["eng"],"title":[{"title":"Lecture notes in computer science","title_sort":"Lecture notes in computer science"}]}],"name":{"displayForm":["by Gerhard Reinelt"]},"person":[{"role":"aut","display":"Reinelt, Gerhard","given":"Gerhard","family":"Reinelt"}],"title":[{"subtitle":"computational solutions for TSP applications","title":"The traveling salesman","title_sort":"traveling salesman"}],"origin":[{"publisherPlace":"Berlin, Heidelberg","dateIssuedDisp":"1994","dateIssuedKey":"1994","publisher":"Springer-Verlag Berlin Heidelberg"}],"id":{"eki":["1649309309"],"doi":["10.1007/3-540-48661-5"],"isbn":["9783540486619"]}} 
SRT |a REINELTGERTRAVELINGS1994