Searching for backbones — an efficient parallel algorithm for the traveling salesman problem

The Traveling Salesman Problem (TSP) plays an important role in Operations Research, Applied Mathematics and Computational Physics. We investigated it using a stochastic approach. Studying several solutions of a special TSP we found that many parts of a good solution are the same in all other good s...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computer physics communications Ročník 96; číslo 2; s. 173 - 188
Hlavní autoři:	Schneider, Johannes, Froschhammer, Christine, Morgenstern, Ingo, Husslein, Thomas, Singer, Johannes Maria
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.08.1996 Elsevier Science
Témata:	Applied sciences Backbone Computational techniques Computer science; control theory; systems Degeneracy Exact sciences and technology Markov processes Mathematical methods in physics Monte Carlo Monte carlo and statistical methods Optimization Other topics of general interest to physicists Parallel Physics Probability theory, stochastic processes, and statistics Theoretical computing Threshold accepting TSP Backbone 02.70.Lq 89.20.+a 89.80.+h Parallel Optimization 89.90.+n TSP 02.50.Ga Degeneracy Monte Carlo Threshold accepting 02.50.-r Travelling salesman problem Parallel processing Computerized simulation Algorithms
ISSN:	0010-4655, 1879-2944
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	The Traveling Salesman Problem (TSP) plays an important role in Operations Research, Applied Mathematics and Computational Physics. We investigated it using a stochastic approach. Studying several solutions of a special TSP we found that many parts of a good solution are the same in all other good solutions for this problem. In this paper we discuss an efficient parallel method to reduce the TSP to a smaller one by finding these backbones and eliminating them to get even better solutions in a very short time and a few observables of interest corresponding to this parallel approach.
AbstractList	The Traveling Salesman Problem (TSP) plays an important role in Operations Research, Applied Mathematics and Computational Physics. We investigated it using a stochastic approach. Studying several solutions of a special TSP we found that many parts of a good solution are the same in all other good solutions for this problem. In this paper we discuss an efficient parallel method to reduce the TSP to a smaller one by finding these backbones and eliminating them to get even better solutions in a very short time and a few observables of interest corresponding to this parallel approach.
Author	Schneider, Johannes Morgenstern, Ingo Singer, Johannes Maria Froschhammer, Christine Husslein, Thomas
Author_xml	– sequence: 1 givenname: Johannes surname: Schneider fullname: Schneider, Johannes email: Johannes.Schneider@physik.uni-regensburg.de organization: Fakultät Physik, Universitätsstr. 31, Universität Regensburg, D-93053 Regensburg, Germany – sequence: 2 givenname: Christine surname: Froschhammer fullname: Froschhammer, Christine organization: Fakultät Physik, Universitätsstr. 31, Universität Regensburg, D-93053 Regensburg, Germany – sequence: 3 givenname: Ingo surname: Morgenstern fullname: Morgenstern, Ingo organization: Fakultät Physik, Universitätsstr. 31, Universität Regensburg, D-93053 Regensburg, Germany – sequence: 4 givenname: Thomas surname: Husslein fullname: Husslein, Thomas organization: Fakultät Physik, Universitätsstr. 31, Universität Regensburg, D-93053 Regensburg, Germany – sequence: 5 givenname: Johannes Maria surname: Singer fullname: Singer, Johannes Maria organization: Physikinstitut, Universität Zürich, CH-8057 Zürich, Switzerland
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3175977$$DView record in Pascal Francis
BookMark	eNqFkMFKHTEYRoMoeLW-gYtZFKmLaZNJJpl0URBRWxBcqFvDP7l_vNHMzG0She76EH3CPkkzXttFF-0qBM75Qs4e2R6nEQk5ZPQ9o0x-oJTRWsi2faflMaVUNnW3RRasU7putBDbZPEH2SV7KT0USCnNF-TuGiHalR_vKzfFqgf72JfxVP38_qOCsULnvPU45moNEULAUEG4n6LPq-HFyCuscoRnDPNGgoBpKN46Tn3A4Q3ZcRASHrye--T2_Ozm9HN9eXXx5fTksrZcilz3zqLSVvOOA8dGyKVwTqmOglOIDmWrUPQt2gaYY70ToBk4ybkEzQVavk-ONrvl3a9PmLIZfLIYAow4PSXTSM6E7FQB376CkCwEF2G0Ppl19APEb4Yz1Wo1Yx83mI1TShGdsT5D9tNY_uqDYdTM5c2c1cxZjZ4vpbzpiiz-kn_P_0f7tNGwhHr2GE2ay1tc-og2m-Xk_z3wC86KntE
CODEN	CPHCBZ
CitedBy_id	crossref_primary_10_1016_j_physa_2009_12_055 crossref_primary_10_2478_fcds_2023_0020 crossref_primary_10_1016_S0378_4371_97_00207_0 crossref_primary_10_1103_PhysRevE_104_035302 crossref_primary_10_1007_s10955_007_9382_1 crossref_primary_10_1016_j_physa_2010_08_045 crossref_primary_10_1093_bioinformatics_btn572 crossref_primary_10_1007_s10994_021_06123_2 crossref_primary_10_1016_j_robot_2006_11_002 crossref_primary_10_1016_j_cor_2005_11_008 crossref_primary_10_2478_acss_2023_0019 crossref_primary_10_1016_S0167_739X_02_00106_1 crossref_primary_10_1287_opre_2018_1763 crossref_primary_10_1038_22055 crossref_primary_10_1145_3091528 crossref_primary_10_1016_j_physa_2011_02_037 crossref_primary_10_1016_S0893_9659_99_00068_3 crossref_primary_10_1088_0953_8984_10_27_013 crossref_primary_10_1006_jcph_1999_6413 crossref_primary_10_1016_j_physa_2010_02_054 crossref_primary_10_1002__SICI_1098_2418_199910_12_15_3_4_414__AID_RSA10_3_0_CO_2_G crossref_primary_10_3724_SP_J_1004_2011_00257 crossref_primary_10_1016_j_cor_2024_106548 crossref_primary_10_1016_j_physa_2010_07_018 crossref_primary_10_1371_journal_pone_0011685 crossref_primary_10_4018_ijncr_2014070102 crossref_primary_10_1007_s10955_010_0080_z
Cites_doi	10.1063/1.1699114 10.1016/0010-4655(95)00004-Y 10.1016/0167-6377(87)90002-2 10.1016/0167-8191(88)90098-1 10.1006/jcph.1993.1010 10.1007/BF01586932 10.1016/0927-0256(95)00016-J 10.1126/science.220.4598.671 10.1016/0021-9991(90)90201-B
ContentType	Journal Article
Copyright	1996 1996 INIST-CNRS
Copyright_xml	– notice: 1996 – notice: 1996 INIST-CNRS
DBID	AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/0010-4655(96)00062-8
DatabaseName	CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Physics Applied Sciences
EISSN	1879-2944
EndPage	188
ExternalDocumentID	3175977 10_1016_0010_4655_96_00062_8 0010465596000628
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARLI AAXUO AAYFN ABBOA ABFNM ABMAC ABNEU ABQEM ABQYD ABXDB ABYKQ ACDAQ ACFVG ACGFS ACLVX ACNNM ACRLP ACSBN ACZNC ADBBV ADECG ADEZE ADJOM ADMUD AEBSH AEKER AENEX AFKWA AFTJW AFZHZ AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIKHN AITUG AIVDX AJBFU AJOXV AJSZI ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG ATOGT AVWKF AXJTR AZFZN BBWZM BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FLBIZ FNPLU FYGXN G-2 G-Q GBLVA GBOLZ HLZ HME HMV HVGLF HZ~ IHE IMUCA J1W KOM LG9 LZ4 M38 M41 MO0 N9A NDZJH O-L O9- OAUVE OGIMB OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SCB SDF SDG SES SEW SHN SPC SPCBC SPD SPG SSE SSK SSQ SSV SSZ T5K TN5 UPT VH1 WUQ ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c364t-bfce79c9383a3e246d4ff7780af7eefe657e4b5ec2a1f1bf4a91af6336a934ec3
ISICitedReferencesCount	46
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=0010465596000628&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0010-4655
IngestDate	Sun Nov 09 14:30:07 EST 2025 Mon Jul 21 09:16:57 EDT 2025 Tue Nov 18 22:32:11 EST 2025 Sat Nov 29 05:31:48 EST 2025 Fri Feb 23 02:28:12 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	Backbone 02.70.Lq 89.20.+a 89.80.+h Parallel Optimization 89.90.+n TSP 02.50.Ga Degeneracy Monte Carlo Threshold accepting 02.50.-r Travelling salesman problem Parallel processing Computerized simulation Algorithms
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c364t-bfce79c9383a3e246d4ff7780af7eefe657e4b5ec2a1f1bf4a91af6336a934ec3
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
PQID	26314687
PQPubID	23500
PageCount	16
ParticipantIDs	proquest_miscellaneous_26314687 pascalfrancis_primary_3175977 crossref_citationtrail_10_1016_0010_4655_96_00062_8 crossref_primary_10_1016_0010_4655_96_00062_8 elsevier_sciencedirect_doi_10_1016_0010_4655_96_00062_8
PublicationCentury	1900
PublicationDate	1996-08-01
PublicationDateYYYYMMDD	1996-08-01
PublicationDate_xml	– month: 08 year: 1996 text: 1996-08-01 day: 01
PublicationDecade	1990
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Computer physics communications
PublicationYear	1996
Publisher	Elsevier B.V Elsevier Science
Publisher_xml	– name: Elsevier B.V – name: Elsevier Science
References	Dueck, Scheuer (BIB1) 1990; 90 Lüling, Monien, Räcke, Tschöke (BIB6) 1991 Gelfand, Mitter (BIB12) 1985 Metropolis, Rosenbluth, Rosenbluth, Teller, Teller (BIB8) 1953; 21 Binder, Heermann (BIB9) 1992 Tafelmayer, Hoffmann (BIB19) 1994 Mitra, Romeo, Sangiovanni-Vincentelli (BIB11) 1985 Stadler, Schnabl (BIB16) 1991 Schneider (BIB3) 1995 Mak, Morton (BIB5) 1991 I. Morgenstern and J. Schneider (1994), unpublished. Nurmela (BIB14) 1993 Dueck (BIB15) 1993; 104 Kirkpatrick, Gelatt, Vecchi (BIB10) 1983; 220 Padberg, Rinaldi (BIB7) 1987; 6 Grötschel, Holland (BIB4) 1991; 51 Mühlenbein, Gorges (BIB23) 1988; 7 Tafelmayer, Hoffmann (BIB18) 1995; 86 Schöneburg, Heinzmann, Feddersen (BIB20) 1994 Goldberg (BIB21) 1989 Schön, Jansen (BIB24) 1995; 4 Reinelt (BIB2) 1991 Mühlenbein (BIB22) 1989 Hoffmann, Würtz, de Groot, Hanf (BIB17) 1991 Grötschel (10.1016/0010-4655(96)00062-8_BIB4) 1991; 51 Lüling (10.1016/0010-4655(96)00062-8_BIB6) 1991 Gelfand (10.1016/0010-4655(96)00062-8_BIB12) 1985 Goldberg (10.1016/0010-4655(96)00062-8_BIB21) 1989 Schön (10.1016/0010-4655(96)00062-8_BIB24) 1995; 4 Dueck (10.1016/0010-4655(96)00062-8_BIB1) 1990; 90 Nurmela (10.1016/0010-4655(96)00062-8_BIB14) 1993 Mühlenbein (10.1016/0010-4655(96)00062-8_BIB23) 1988; 7 Mühlenbein (10.1016/0010-4655(96)00062-8_BIB22) 1989 Dueck (10.1016/0010-4655(96)00062-8_BIB15) 1993; 104 Mak (10.1016/0010-4655(96)00062-8_BIB5) 1991 Schneider (10.1016/0010-4655(96)00062-8_BIB3) 1995 Hoffmann (10.1016/0010-4655(96)00062-8_BIB17) 1991 Padberg (10.1016/0010-4655(96)00062-8_BIB7) 1987; 6 Stadler (10.1016/0010-4655(96)00062-8_BIB16) 1991 Mitra (10.1016/0010-4655(96)00062-8_BIB11) 1985 Tafelmayer (10.1016/0010-4655(96)00062-8_BIB19) 1994 Metropolis (10.1016/0010-4655(96)00062-8_BIB8) 1953; 21 Tafelmayer (10.1016/0010-4655(96)00062-8_BIB18) 1995; 86 Reinelt (10.1016/0010-4655(96)00062-8_BIB2) 1991 Kirkpatrick (10.1016/0010-4655(96)00062-8_BIB10) 1983; 220 Schöneburg (10.1016/0010-4655(96)00062-8_BIB20) 1994 10.1016/0010-4655(96)00062-8_BIB13 Binder (10.1016/0010-4655(96)00062-8_BIB9) 1992
References_xml	– volume: 104 start-page: 86 year: 1993 ident: BIB15 article-title: New optimization heuristics: the great Deluge algorithm and the record-to-record travel publication-title: J. Comput. Phys. – year: 1991 ident: BIB17 article-title: Concepts in Optimizing Simulated Annealing: an Adaptive Approach for Parallel and Vector Machines – year: 1991 ident: BIB6 article-title: Efficient Parallelization of a Branch & Bound Algorithm for the Symmetric Traveling Salesman Problem – start-page: 761 year: 1985 ident: BIB11 article-title: Convergence and finite-time behavior of simulated annealing publication-title: Proc. 24th Conf. Decision and Control – year: 1992 ident: BIB9 article-title: Monte Carlo Simulation in Statistical Physics – start-page: 779 year: 1985 ident: BIB12 article-title: Analysis of simulated annealing for optimization publication-title: Proc. 24th Conf. on Decision and Control – volume: 6 start-page: 1 year: 1987 ident: BIB7 article-title: Optimization of a 532-city symmetric travelling salesman problem by branch and cut publication-title: Operations Research Letters – year: 1994 ident: BIB19 article-title: Adaptive Schedules for Ensemble Based Threshold Accepting – year: 1995 ident: BIB3 article-title: Diploma thesis publication-title: Parallelisierung Physikalischer Optimierungsverfahren – year: 1991 ident: BIB5 article-title: A modified Lin-Kernighan traveling salesman heuristic publication-title: UIC CRIM Working Paper 91-01 – year: 1994 ident: BIB20 article-title: Genetische Algorithmen und Evolutionsstrategien – volume: 7 year: 1988 ident: BIB23 article-title: Evolution algorithms in combinatorial optimization publication-title: Parallel Computing – volume: 51 start-page: 141 year: 1991 ident: BIB4 article-title: Solution of large-scale symmetric travelling salesman problems publication-title: Mathematical Programming – start-page: 416ff year: 1989 ident: BIB22 article-title: Parallel genetic algorithms, population genetics and combinatorial optimization publication-title: Proc. Third International Conference on Genetic Algorithms – volume: 220 start-page: 671 year: 1983 ident: BIB10 article-title: Optimization by simulated annealing publication-title: Science – year: 1993 ident: BIB14 article-title: Constructing Combinatorial Designs by Local Search publication-title: Research Report A27 – volume: 86 start-page: 81 year: 1995 ident: BIB18 article-title: Scaling features in complex optimization problems publication-title: Comput. Phys. Commun. – year: 1989 ident: BIB21 article-title: Genetic Algorithms in Search, Optimization and Machine Learning – year: 1991 ident: BIB16 article-title: The landscape of the traveling salesman problem, preprint 91-047 publication-title: Preprintreihe Sonderforschungsbereich 343, Diskrete Strukturen in der Mathematik – volume: 90 start-page: 161 year: 1990 ident: BIB1 article-title: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing publication-title: J. Comput. Phys. – year: 1991 ident: BIB2 article-title: TSPLIB publication-title: Report No. 330 – volume: 21 start-page: 1087 year: 1953 ident: BIB8 article-title: Equation of state calculation by fast computing machines publication-title: J. Chem. Phys. – volume: 4 start-page: 43 year: 1995 ident: BIB24 article-title: Determination of candidate structures for simple ionic compounds through cell optimization publication-title: Comp. Mat. Science – reference: I. Morgenstern and J. Schneider (1994), unpublished. – year: 1994 ident: 10.1016/0010-4655(96)00062-8_BIB19 – volume: 21 start-page: 1087 year: 1953 ident: 10.1016/0010-4655(96)00062-8_BIB8 article-title: Equation of state calculation by fast computing machines publication-title: J. Chem. Phys. doi: 10.1063/1.1699114 – year: 1992 ident: 10.1016/0010-4655(96)00062-8_BIB9 – volume: 86 start-page: 81 year: 1995 ident: 10.1016/0010-4655(96)00062-8_BIB18 article-title: Scaling features in complex optimization problems publication-title: Comput. Phys. Commun. doi: 10.1016/0010-4655(95)00004-Y – year: 1989 ident: 10.1016/0010-4655(96)00062-8_BIB21 – year: 1991 ident: 10.1016/0010-4655(96)00062-8_BIB5 article-title: A modified Lin-Kernighan traveling salesman heuristic – volume: 6 start-page: 1 year: 1987 ident: 10.1016/0010-4655(96)00062-8_BIB7 article-title: Optimization of a 532-city symmetric travelling salesman problem by branch and cut publication-title: Operations Research Letters doi: 10.1016/0167-6377(87)90002-2 – year: 1991 ident: 10.1016/0010-4655(96)00062-8_BIB2 article-title: TSPLIB – year: 1991 ident: 10.1016/0010-4655(96)00062-8_BIB17 – year: 1994 ident: 10.1016/0010-4655(96)00062-8_BIB20 – volume: 7 year: 1988 ident: 10.1016/0010-4655(96)00062-8_BIB23 article-title: Evolution algorithms in combinatorial optimization publication-title: Parallel Computing doi: 10.1016/0167-8191(88)90098-1 – year: 1991 ident: 10.1016/0010-4655(96)00062-8_BIB6 – volume: 104 start-page: 86 year: 1993 ident: 10.1016/0010-4655(96)00062-8_BIB15 article-title: New optimization heuristics: the great Deluge algorithm and the record-to-record travel publication-title: J. Comput. Phys. doi: 10.1006/jcph.1993.1010 – ident: 10.1016/0010-4655(96)00062-8_BIB13 – volume: 51 start-page: 141 year: 1991 ident: 10.1016/0010-4655(96)00062-8_BIB4 article-title: Solution of large-scale symmetric travelling salesman problems publication-title: Mathematical Programming doi: 10.1007/BF01586932 – volume: 4 start-page: 43 year: 1995 ident: 10.1016/0010-4655(96)00062-8_BIB24 article-title: Determination of candidate structures for simple ionic compounds through cell optimization publication-title: Comp. Mat. Science doi: 10.1016/0927-0256(95)00016-J – volume: 220 start-page: 671 year: 1983 ident: 10.1016/0010-4655(96)00062-8_BIB10 article-title: Optimization by simulated annealing publication-title: Science doi: 10.1126/science.220.4598.671 – year: 1993 ident: 10.1016/0010-4655(96)00062-8_BIB14 article-title: Constructing Combinatorial Designs by Local Search – year: 1991 ident: 10.1016/0010-4655(96)00062-8_BIB16 article-title: The landscape of the traveling salesman problem, preprint 91-047 – volume: 90 start-page: 161 year: 1990 ident: 10.1016/0010-4655(96)00062-8_BIB1 article-title: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing publication-title: J. Comput. Phys. doi: 10.1016/0021-9991(90)90201-B – start-page: 416ff year: 1989 ident: 10.1016/0010-4655(96)00062-8_BIB22 article-title: Parallel genetic algorithms, population genetics and combinatorial optimization – start-page: 779 year: 1985 ident: 10.1016/0010-4655(96)00062-8_BIB12 article-title: Analysis of simulated annealing for optimization – start-page: 761 year: 1985 ident: 10.1016/0010-4655(96)00062-8_BIB11 article-title: Convergence and finite-time behavior of simulated annealing – year: 1995 ident: 10.1016/0010-4655(96)00062-8_BIB3 article-title: Diploma thesis
SSID	ssj0007793
Score	1.6992314
Snippet	The Traveling Salesman Problem (TSP) plays an important role in Operations Research, Applied Mathematics and Computational Physics. We investigated it using a...
SourceID	proquest pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	173
SubjectTerms	Applied sciences Backbone Computational techniques Computer science; control theory; systems Degeneracy Exact sciences and technology Markov processes Mathematical methods in physics Monte Carlo Monte carlo and statistical methods Optimization Other topics of general interest to physicists Parallel Physics Probability theory, stochastic processes, and statistics Theoretical computing Threshold accepting TSP
Title	Searching for backbones — an efficient parallel algorithm for the traveling salesman problem
URI	https://dx.doi.org/10.1016/0010-4655(96)00062-8 https://www.proquest.com/docview/26314687
Volume	96
WOSCitedRecordID	wos0010465596000628&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2944 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007793 issn: 0010-4655 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NbhMxELZCClIlhPhVAxR84ACqVmT_7PWxQkWARFWJIuXEyuvYTdWwibLbqkcegifiUXgSZtY_mypCBSQuVuLsriPP55mx95sZQl6AlckE13GkEy6ibJqbSI61jFQuxrJi00Rx0xWb4IeHxWQijgaDHz4W5mLO67q4vBTL_ypq6ANhY-jsX4g7PBQ64DMIHVoQO7R_JHhLIPYEyUqqswrz8e95WkO2B0tad5kjkAeAub_nc41E5ZPF6rSdfQ3MwxZLE3Xh6g2YkQZP-139mXWX1teFcIckDbLU-5iT4LJ_UrMac2qtHAFYgoK_EnuiZrPuFL1PebD2yv8jntzXXVIHq9VOFj0gwVd2JTvX6E5TF9rHAo_OHa9thNhYlQ2GApO8WYNltXQBuEqETRzp1bgtjOvgmqzp5NjWSnHmPbZVBDcshz3ECKOBey-gA0uqsiQqemsZOIxdZiO4EraAXSDqDbKV8FwUQ7K1__5g8iH4A5y71M_u0T6AM2avQ99LwV65oX7nIN1eygaWrbH1VjZch84fOr5L7riNDN23ALxHBrq-T24dWQw8IF8CDCnAiQYY0p_fvlNZ0wBA6gFIAwC7OwCANACQegBSB8CH5PPbg-M37yJXyyNSKcvaqDJKc6FEWqQy1UnGppkxnBdjabjWRrOc66zKtUpkbOLKZFLE0rA0ZVKkmVbpIzKs4W_uIBkPg8GTsZrG8EuMkdwKGi2KXGWxqEYk9RNYKpfoHuutzEvPaMRpL3HaS4FfYNrLYkSicNfSJnq55nruZVM6Z9U6oSUg6po7d6-IMgyHrjxsx0bkuRdtCboeX-DJWi_OmzJhKUZK8sf_PPYTst2vvKdk2K7O9S65qS7a02b1zCH3F0gZzbg
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Searching+for+backbones+%E2%80%94+an+efficient+parallel+algorithm+for+the+traveling+salesman+problem&rft.jtitle=Computer+physics+communications&rft.au=Schneider%2C+Johannes&rft.au=Froschhammer%2C+Christine&rft.au=Morgenstern%2C+Ingo&rft.au=Husslein%2C+Thomas&rft.date=1996-08-01&rft.pub=Elsevier+B.V&rft.issn=0010-4655&rft.eissn=1879-2944&rft.volume=96&rft.issue=2&rft.spage=173&rft.epage=188&rft_id=info:doi/10.1016%2F0010-4655%2896%2900062-8&rft.externalDocID=0010465596000628
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0010-4655&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0010-4655&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0010-4655&client=summon