|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 516 occurrences of 298 keywords
|
|
|
Results
Found 3392 publication records. Showing 3392 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
126 | Yi-Jen Chiang |
New Approximation Results for the Maximum Scatter TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(4), pp. 309-341, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Traveling salesperson problem (TSP), Maximum scatter TSP, Bottleneck TSP, Hamiltonian cycle/path, Optimization, Approximation algorithms, Matching |
119 | Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002, Guido Proietti, Peter Widmayer |
Reusing Optimal TSP Solutions for Locally Modified Input Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), IFIP 19th World Computer Congress, TC-1 Foundations of Computer Science, August 23-24, 2006, Santiago, Chile, pp. 251-270, 2006, Springer, 0-387-34633-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
105 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger |
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 382-394, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
103 | Ming Yang 0003, Zhou Kang, Lishan Kang |
A Parallel Multi-algorithm Solver for Dynamic Multi-Objective TSP (DMO-TSP). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 164-173, 2008, Springer, 978-3-540-85983-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
dynamic multi-objective TSP, parallel multi-algorithm, Pareto optimal front |
100 | Vladimir G. Deineko, Alexandre Tiskin |
One-Sided Monge TSP Is NP-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part III, pp. 793-801, 2006, Springer, 3-540-34075-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
91 | Fred W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich |
Construction Heuristics and Domination Analysis for the Asymmetric TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAE ![In: Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK, July 19-21, 1999, Proceedings, pp. 85-94, 1999, Springer, 3-540-66427-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
90 | Ming Yang 0003, Lishan Kang, Jing Guan |
An Evolutionary Algorithm for Dynamic Multi-Objective TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISICA ![In: Advances in Computation and Intelligence, Second International Symposium, ISICA 2007, Wuhan, China, September 21-23, 2007, Proceedings, pp. 62-71, 2007, Springer, 978-3-540-74580-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
dynamic multi-objective TSP optimization, Paretos-Similarity, evolutionary algorithm |
85 | Sejong Yoon, Saejoon Kim |
k-Top Scoring Pair Algorithm for feature selection in SVM with applications to microarray data classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 14(2), pp. 151-159, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Top Scoring Pair, k-TSP, SVM-RFE, SVM, Ensemble methods |
81 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002 |
The Parameterized Approximability of TSP with Deadlines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(3), pp. 431-444, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
71 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton |
Improved lower and upper bounds for universal TSP in planar metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 649-658, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
71 | David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook |
TSP Cuts Which Do Not Conform to the Template Paradigm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Combinatorial Optimization ![In: Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000], pp. 261-304, 2001, Springer, 3-540-42877-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
62 | Youngkyu Park, Ho-Jin Choi, Jongmoon Baik |
A Framework for the Use of Six Sigma Tools in PSP/TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SERA ![In: 5th ACIS International Conference on Software Engineering Research, Management & Applications (SERA 2007), August 20-22, 2007, Haeundae Grand Hotel, Busan, Korea, pp. 807-814, 2007, IEEE Computer Society, 0-7695-2867-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
62 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 56-65, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
62 | Béla Csaba, Marek Karpinski, Piotr Krysta |
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 74-83, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
62 | Tinghong Zhao, Zibin Man, Xueyi Qi |
A MSM-PGA Based on Multi-agent for Solving TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIP ![In: International Symposium on Information Processing, ISIP 2008 / International Pacific Workshop on Web Mining, and Web-Based Application, WMWA 2008, Moscow, Russia, 23-25 May 2008, pp. 548-552, 2008, IEEE Computer Society, 978-0-7695-3151-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Agent union, MSM-PGA, Self-adaptive genetic algorithm, Multi-Agent, TSP |
62 | Ranieri Baraglia, José Ignacio Hidalgo, Raffaele Perego 0001 |
A Parallel Hybrid Heuristic for the TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20, 2001, Proceedings, pp. 193-202, 2001, Springer, 3-540-41920-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Lin-Kernighan algorithm, hybrid GA, Parallel algorithms, TSP, compact genetic algorithm |
62 | Michelangelo Grigni |
Approximate TSP in Graphs with Forbidden Minors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 869-877, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
TSP, separator, spanner, approximation scheme, graph minor, genus |
61 | Sanjeev Arora |
Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 554-563, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
randomized polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, nearly-linear time approximation, randomized, Steiner Tree, parallel implementations, randomised algorithms, geometric problems |
58 | Shuqin Wang, Chunbao Zhou, Yingsi Wu, Jianxin Wang, Chunguang Zhou, Yanchun Liang 0001 |
A Novel Approach for Classifying Human Cancers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICYCS ![In: Proceedings of the 9th International Conference for Young Computer Scientists, ICYCS 2008, Zhang Jia Jie, Hunan, China, November 18-21, 2008, pp. 976-981, 2008, IEEE Computer Society, 978-0-7695-3398-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
58 | Rae-Goo Kang, Chai-Yeoung Jung |
The Improved Initialization Method of Genetic Algorithm for Solving the Optimization Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICONIP (3) ![In: Neural Information Processing, 13th International Conference, ICONIP 2006, Hong Kong, China, October 3-6, 2006, Proceedings, Part III, pp. 789-796, 2006, Springer, 3-540-46484-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Genetic Algorithm, Optimization, Initialization, GA |
55 | Zhi-Zhong Chen, Takayuki Nagoya |
Improved approximation algorithms for metric MaxTSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(4), pp. 321-336, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Max TSP, Metric Max TSP, Approximation Algorithms, Randomized Algorithms, TSP, Derandomization |
52 | Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor |
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings, pp. 175-187, 2009, Springer, 978-3-642-02157-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
52 | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger |
Four point conditions and exponential neighborhoods for symmetric TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 544-553, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002 |
On the Approximation Hardness of Some Generalizations of TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings, pp. 184-195, 2006, Springer, 3-540-35753-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(4), pp. 602-626, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithms |
52 | Helei Wu, Yirong Yang |
Application of continuous Hopfield network to solve the TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICARCV ![In: 8th International Conference on Control, Automation, Robotics and Vision, ICARCV 2004, Kunming, China, 6-9 December 2004, Proceedings, pp. 2258-2263, 2004, IEEE, 0-7803-8653-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
52 | Mikael Hammar, Bengt J. Nilsson |
Approximation Results for Kinetic Variants of TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 27(4), pp. 635-651, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
52 | Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky |
Moving-Target TSP and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings, pp. 453-464, 1998, Springer, 3-540-64848-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
52 | Yasuhiro Tsujimura, Mitsuo Gen |
Entropy-based genetic algorithm for solving TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (2) ![In: Knowledge-Based Intelligent Electronic Systems, 2nd International Conference, KES 1998, Adelaide, South Australia, 21-23 April 1998, Proceedings, Part II, pp. 285-290, 1998, IEEE. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
52 | Joseph S. B. Mitchell |
A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 183-191, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
approximation algorithm, TSP |
52 | Yong-Qin Tao, Du-Wu Cui, Xianglin Miao, Hao Chen |
An Improved Swarm Intelligence Algorithm for Solving TSP Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, Third International Conference on Intelligent Computing, ICIC 2007, Qingdao, China, August 21-24, 2007, Proceedings, pp. 813-822, 2007, Springer, 978-3-540-74201-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
swarm intelligence algorithm, tsp, gene regulation |
52 | István Borgulya |
An EC-memory based method for the multi-objective TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pp. 903, 2007, ACM, 978-1-59593-697-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
EC-memory, multi-objective optimization, TSP |
52 | Roi Blanco, Alvaro Barreiro |
TSP and cluster-based solutions to the reassignment of document identifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Retr. ![In: Inf. Retr. 9(4), pp. 499-517, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Document identifier reassignment, Clustering, Indexing, Compression, SVD, TSP |
52 | Rae-Goo Kang, Chai-Yeoung Jung |
The Optimal Solution of TSP Using the New Mixture Initialization and Sequential Transformation Method in Genetic Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRICAI ![In: PRICAI 2006: Trends in Artificial Intelligence, 9th Pacific Rim International Conference on Artificial Intelligence, Guilin, China, August 7-11, 2006, Proceedings, pp. 1181-1185, 2006, Springer, 3-540-36667-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Genetic Algorithm, TSP, Initialization, GA |
50 | Sanjeev Arora |
Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 2-11, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, k-TSP, Minimum degree-k, k-MST, computational geometry, spanning tree, Steiner Tree, best approximation, geometric problems |
48 | Xiao-Bing Hu, Ezequiel A. Di Paolo |
A Hybrid Genetic Algorithm for the Travelling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NICSO ![In: Nature Inspired Cooperative Strategies for Optimization (NICSO 2007), pp. 357-367, 2007, Springer, 978-3-540-78986-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
48 | Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth |
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings, pp. 360-371, 2005, Springer, 3-540-30495-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Jun Sakuma, Shigenobu Kobayashi |
A genetic algorithm for privacy preserving combinatorial optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pp. 1372-1379, 2007, ACM, 978-1-59593-697-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
privacy preserving optimization, security, privacy, TSP, GA |
47 | José García Pérez, Salvador Cruz Rambaud, Lina B. García García |
The two-sided power distribution for the treatment of the uncertainty in PERT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stat. Methods Appl. ![In: Stat. Methods Appl. 14(2), pp. 209-222, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
TSP distribution, mesokurtic, constant variance, PERT, Beta |
43 | Sophie Toulouse, Roberto Wolfler Calvo |
On the Complexity of the Multiple Stack TSP, kSTSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 360-369, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | T.-H. Hubert Chan, Anupam Gupta 0001 |
Approximating TSP on metrics with bounded global growth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 690-699, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
43 | Michele Aicardi, Davide Giglio, Riccardo Minciardi |
Determination of optimal control strategies for TSP by dynamic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008, December 9-11, 2008, Cancún, Mexico, pp. 2160-2167, 2008, IEEE, 978-1-4244-3123-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
43 | Mehrdad Nojoumian, Divya K. Nair |
Comparing genetic algorithm and guided local search methods by symmetric TSP instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 1131-1132, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
genetic algorithm, guided local search |
43 | Marcin Czajkowski, Marek Kretowski |
Novel Extension of k-TSP Algorithm for Microarray Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: New Frontiers in Applied Artificial Intelligence, 21st International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2008, Wroclaw, Poland, June 18-20, 2008, Proceedings, pp. 456-465, 2008, Springer, 978-3-540-69045-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
43 | Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo, Adrian Ion, Andreas Lehrbaum |
Approximating TSP Solution by MST Based Graph Pyramid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GbRPR ![In: Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings, pp. 295-306, 2007, Springer, 978-3-540-72902-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Vladimir G. Deineko, Alexandre Tiskin |
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings, pp. 136-149, 2007, Springer, 978-3-540-72844-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Paula Cecilia Fritzsche, Dolores Rexachs, Emilio Luque |
A Computational Approach to TSP Performance Prediction Using Data Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA Workshops (1) ![In: 21st International Conference on Advanced Information Networking and Applications (AINA 2007), Workshops Proceedings, Volume 1, May 21-23, 2007, Niagara Falls, Canada, pp. 252-259, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Yuichi Nagata |
New EAX Crossover for Large TSP Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Procedings, pp. 372-381, 2006, Springer, 3-540-38990-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
43 | Shubhra Sankar Ray, Sanghamitra Bandyopadhyay, Sankar K. Pal |
New Genetic Operators for Solving TSP: Application to Microarray Gene Ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PReMI ![In: Pattern Recognition and Machine Intelligence, First International Conference, PReMI 2005, Kolkata, India, December 20-22, 2005, Proceedings, pp. 617-622, 2005, Springer, 3-540-30506-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters |
Approximation Algorithms for Euclidean Group TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 1115-1126, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Thomas Fischer 0003, Peter Merz |
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), CD-ROM / Abstracts Proceedings, 4-8 April 2005, Denver, CO, USA, 2005, IEEE Computer Society, 0-7695-2312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Chao-Xue Wang, Du-Wu Cui, Zhu-Rong Wang, Duo Chen |
A Novel Ant Colony System Based on Minimum 1-Tree and Hybrid Mutation for TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC (2) ![In: Advances in Natural Computation, First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part II, pp. 1269-1278, 2005, Springer, 3-540-28325-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Thang Nguyen Bui, Mufit Colpan |
Solving geometric TSP with ants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005, pp. 271-272, 2005, ACM, 1-59593-010-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
traveling salesman problem, ant system |
43 | Wen-Lung Shu, Chen-Cheng Wu, Wei-Cheng Lai |
Design the Hardware of Genetic Algorithm for TSP and MSA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES ![In: Knowledge-Based Intelligent Information and Engineering Systems, 8th International Conference, KES 2004, Wellington, New Zealand, September 20-25, 2004. Proceedings. Part II, pp. 1260-1267, 2004, Springer, 3-540-23206-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
43 | Tim Hendtlass |
TSP Optimisation Using Multi Tour Ants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Innovations in Applied Artificial Intelligence, 17th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2004, Ottawa, Canada, May 17-20, 2004. Proceedings, pp. 523-532, 2004, Springer, 3-540-22007-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
travelling salesperson problem, heuristic search, Ant colony optimisation |
43 | Avrim Blum, Shuchi Chawla 0001, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff |
Approximation Algorithms for Orienteering and Discounted-Reward TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 46-55, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
43 | Marcin L. Pilat, Tony White |
Using Genetic Algorithms to Optimize ACS-TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ant Algorithms ![In: Ant Algorithms, Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002, Proceedings, pp. 282-287, 2002, Springer, 3-540-44146-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Lars Engebretsen, Marek Karpinski |
Approximation Hardness of TSP with Bounded Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 201-212, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
43 | Mikael Hammar, Bengt J. Nilsson |
Approximation Results for Kinetic Variants of TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 392-401, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
43 | Paula Cecilia Fritzsche, Dolores Rexachs, Emilio Luque |
A General Approach to Predict the Performance Order of TSP Family Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA3PP ![In: Algorithms and Architectures for Parallel Processing, 8th International Conference, ICA3PP 2008, Cyprus, June 9-11, 2008, Proceedings, pp. 97-108, 2008, Springer, 978-3-540-69500-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Data-dependent algorithms, Parallel computing, TSP, Performance prediction |
43 | Chengming Qi |
An Ant Colony System Hybridized with Randomized Algorithm for TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNPD (3) ![In: Proceedings of the 8th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2007, July 30 - August 1, 2007, Qingdao, China, pp. 461-465, 2007, IEEE Computer Society, 0-7695-2909-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Combinatorial Optimization, Randomized Algorithm, TSP, Ant Colony System |
43 | Birger Funke, Tore Grünert, Stefan Irnich |
A Note on Single Alternating Cycle Neighborhoods for the TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 11(2), pp. 135-146, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
edge-exchange neighborhoods, Lin-Kernighan, ejection chains, local search, TSP |
43 | Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram |
Universal approximations for TSP, Steiner tree, and set cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 386-395, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
sparse partition, approximation algorithms, TSP, Steiner tree, set cover, universal approximation |
42 | Cristian Marinescu, Nicolae Tapus |
Some Critical Aspects of the PKIX TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Communications and Multimedia Security ![In: Communications and Multimedia Security, 9th IFIP TC-6 TC-11 International Conference, CMS 2005, Salzburg, Austria, September 19-21, 2005, Proceedings, pp. 286-288, 2005, Springer, 3-540-28791-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
TSA, PKIX TSP, security, PKI, time-stamp |
42 | María Auxilio Osorio Lama, David Pinto 0001 |
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI ![In: MICAI 2004: Advances in Artificial Intelligence, Third Mexican International Conference on Artificial Intelligence, Mexico City, Mexico, April 26-30, 2004, Proceedings, pp. 727-734, 2004, Springer, 3-540-21459-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
TSP problem, Surrogate Constraint Analysis, Preprocessing |
38 | Lounell B. Gueta, Ryosuke Chiba, Jun Ota 0001, Tsuyoshi Ueyama, Tamio Arai |
Coordinated motion control of a robot arm and a positioning table with arrangement of multiple goals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICRA ![In: 2008 IEEE International Conference on Robotics and Automation, ICRA 2008, May 19-23, 2008, Pasadena, California, USA, pp. 2252-2258, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Guilherme De A. Barreto |
Time Series Prediction with the Self-Organizing Map: A Review. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Perspectives of Neural-Symbolic Integration ![In: Perspectives of Neural-Symbolic Integration, pp. 135-158, 2007, Springer, 978-3-540-73953-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Wen-liang Zhong, Jun Zhang 0003, Wei-neng Chen |
A novel discrete particle swarm optimization to solve traveling salesman problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 3283-3287, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Michael Butts, Anthony Mark Jones, Paul Wasson |
A Structural Object Programming Model, Architecture, Chip and Tools for Reconfigurable Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCCM ![In: IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2007, 23-25 April 2007, Napa, California, USA, pp. 55-64, 2007, IEEE Computer Society, 0-7695-2940-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Ioannis Mavroidis, Ioannis Papaefstathiou, Dionisios N. Pnevmatikatos |
A Fast FPGA-Based 2-Opt Solver for Small-Scale Euclidean Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCCM ![In: IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2007, 23-25 April 2007, Napa, California, USA, pp. 13-22, 2007, IEEE Computer Society, 0-7695-2940-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Viswanath Nagarajan, R. Ravi 0001 |
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 257-270, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom |
Biased Mutation Operators for Subgraph-Selection Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Evol. Comput. ![In: IEEE Trans. Evol. Comput. 10(2), pp. 145-156, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Chun Wai Kong, Jack Y. B. Lee, Mounir Hamdi, Victor O. K. Li |
Turbo-slice-and-patch: an algorithm for metropolitan scale VBR video streaming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Circuits Syst. Video Technol. ![In: IEEE Trans. Circuits Syst. Video Technol. 16(3), pp. 338-353, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Peitsang Wu, Kung-Jiuan Yang, Hsin-Chieh Fang |
A Revised EM-Like Algorithm + K-OPT Method for Solving the Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICICIC (1) ![In: First International Conference on Innovative Computing, Information and Control (ICICIC 2006), 30 August - 1 September 2006, Beijing, China, pp. 546-549, 2006, IEEE Computer Society, 0-7695-2616-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Yuichi Nagata |
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization, 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings, pp. 171-182, 2006, Springer, 3-540-33178-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Bodo Manthey, L. Shankar Ram |
Approximation Algorithms for Multi-criteria Traveling Salesman Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers, pp. 302-315, 2006, Springer, 3-540-69513-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Huidang Zhang, Yuyao He |
Comparative Study of Chaotic Neural Networks with Different Models of Chaotic Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC (1) ![In: Advances in Natural Computation, First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I, pp. 273-282, 2005, Springer, 3-540-28323-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Vladimir G. Deineko, Michael Hoffmann 0001, Yoshio Okamoto, Gerhard J. Woeginger |
The Traveling Salesman Problem with Few Inner Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 268-277, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Alessio Plebe |
An Effective Traveling Salesman Problem Solver Based on Self-Organizing Map. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANN ![In: Artificial Neural Networks - ICANN 2002, International Conference, Madrid, Spain, August 28-30, 2002, Proceedings, pp. 908-913, 2002, Springer, 3-540-44074-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
38 | Gill Barequet, Matthew Dickerson, Michael T. Goodrich |
Voronoi Diagrams for Convex Polygon-Offset Distance Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 25(2), pp. 271-291, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
38 | Lixin Yang, Deborah A. Stacey |
Solving the Traveling Salesman Problem Using the Enhanced Genetic Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: Advances in Artificial Intelligence, 14th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AI 2001, Ottawa, Canada, June 7-9, 2001, Proceedings, pp. 307-316, 2001, Springer, 3-540-42144-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
38 | Cristina G. Fernandes, Till Nierhoff |
The UPS Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 238-246, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
38 | Jin-Wook Baek, Jae-Heung Yeo, Gyu-Tae Kim, Heon Young Yeom |
Cost Effective Mobile Agent Planning for Distributed Information Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), Phoenix, Arizona, USA, April 16-19, 2001, pp. 65-72, 2001, IEEE Computer Society, 0-7695-1077-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Mobile Agent Planning, Mobile Computing, Mobile Agents, Distributed Information Retrieval, Distributed Agent System |
38 | Kay C. Wiese, Scott D. Goodwin, Sivakumar Nagarajan |
ASERC - A Genetic Sequencing Operator for Asymmetric Permutation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: Advances in Artificial Intelligence, 13th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AI 2000, Montréal, Quebec, Canada, May 14-17, 2000, Proceedings, pp. 201-213, 2000, Springer, 3-540-67557-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
38 | Alberto Caprara, Matteo Fischetti, Adam N. Letchford |
On the Separation of Maximally Violated mod-k Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings, pp. 87-98, 1999, Springer, 3-540-66019-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Marcelo M. de Azevedo, Douglas M. Blough |
Multistep Interactive Convergence: An Efficient Approach to the Fault-Tolerant Clock Synchronization of Large Multicomputers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 9(12), pp. 1195-1212, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
interactive convergence, fault tolerance, multicomputers, Clock synchronization |
38 | Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger |
The Travelling Salesman and the PQ-Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings, pp. 490-504, 1996, Springer, 3-540-61310-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Euclidean travelling salesman problem, PQ-tree, Dynamic programming, Combinatorial optimization, Travelling salesman problem, Polynomial algorithm |
38 | Takuro Fukunaga, Hiroshi Nagamochi |
Network Design with Edge-Connectivity and Degree Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(3), pp. 512-532, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Degree constraint, (m,n)-VRP, Approximation algorithm, TSP, Vehicle routing problem, Edge-connectivity |
38 | Priscila Machado Vieira Lima, Glaucia C. Pereira, M. Mariela Morveli-Espinoza, Felipe M. G. França |
Mapping and Combining Combinatorial Problems into Energy Landscapes via Pseudo-Boolean Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BVAI ![In: Brain, Vision, and Artificial Intelligence, First International Symposium, BVAI 2005, Naples, Italy, October 19-21, 2005, Proceedings, pp. 308-317, 2005, Springer, 3-540-29282-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Higher-order Networks, Pseudo-Boolean Constraints, Simulated Annealing, TSP, Satisfiability, Graph Colouring |
38 | Dong-il Seo, Byung Ro Moon |
Computing the epistasis variance of large-scale traveling salesman problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005, pp. 1169-1176, 2005, ACM, 1-59593-010-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
TSP, traveling salesman problem, linkage, epistasis |
37 | Xiao-Feng Xie 0001, Jiming Liu 0001 |
How autonomy oriented computing (AOC) tackles a computationally hard optimization problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006, pp. 646-653, 2006, ACM, 1-59593-303-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
autonomy oriented computing (AOC), search, multiagent system, global optimization, traveling salesman problem (TSP), emergent, cooperative problem solving, collective behavior |
37 | Andreas Baltz, Tomasz Schoen, Anand Srivastav |
On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings, pp. 192-201, 2001, Springer, 3-540-42470-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Asymmetric b-partite TSP, Assignment Problem |
33 | Yi Liu, Shengwu Xiong, Hongbing Liu |
Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GEC Summit ![In: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC Summit 2009, Shanghai, China, June 12-14, 2009, pp. 895-898, 2009, ACM, 978-1-60558-326-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
adaptive, tabu search, simulated annealing algorithm |
33 | Peter Merz, Jutta Huhse |
An Iterated Local Search Approach for Finding Provably Good Solutions for Very Large TSP Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN X, 10th International Conference Dortmund, Germany, September 13-17, 2008, Proceedings, pp. 929-939, 2008, Springer, 978-3-540-87699-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | David R. Karger, Jacob Scott 0001 |
Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 104-117, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Shubhra Sankar Ray, Sanghamitra Bandyopadhyay, Sankar K. Pal |
Genetic operators for combinatorial optimization in TSP and microarray gene ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 26(3), pp. 183-195, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Gene analysis, Biocomputing, Data mining, Evolutionary algorithm, Microarray, Soft computing |
33 | Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor |
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAN ![In: Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers, pp. 99-111, 2007, Springer, 978-3-540-77293-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Lin-Kernighan Heuristic, Double Bridge Technique, Traveling Salesman Problem, Tolerances, Backbones |
33 | Changsheng Zhang 0001, Jigui Sun, Yan Wang, Qingyun Yang |
An Improved Discrete Particle Swarm Optimization Algorithm for TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Web Intelligence/IAT Workshops ![In: Proceedings of the 2007 IEEE/WIC/ACM International Conference on Web Intelligence and International Conference on Intelligent Agent Technology - Workshops, 2-5 November 2007, Silicon Valley, CA, USA, pp. 35-38, 2007, IEEE Computer Society, 0-7695-3028-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Shmuel Safra, Oded Schwartz |
On the complexity of approximating tsp with neighborhoods and related problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(4), pp. 281-307, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
68Q25, Subject classification. 68Q17 |
33 | Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters |
On Approximating the TSP with Intersecting Neighborhoods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 213-222, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 3392 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|