The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for tsp with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1970-1990 (16) 1991-1994 (26) 1995-1996 (29) 1997 (17) 1998 (19) 1999 (26) 2000 (26) 2001 (27) 2002 (40) 2003 (42) 2004 (43) 2005 (74) 2006 (86) 2007 (103) 2008 (87) 2009 (70) 2010 (49) 2011 (174) 2012 (204) 2013 (236) 2014 (54) 2015 (322) 2016 (262) 2017 (235) 2018 (239) 2019 (228) 2020 (213) 2021 (151) 2022 (144) 2023 (141) 2024 (9)
Publication types (Num. hits)
article(620) book(1) incollection(24) inproceedings(2730) phdthesis(4) proceedings(13)
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
126Yi-Jen Chiang New Approximation Results for the Maximum Scatter TSP. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Traveling salesperson problem (TSP), Maximum scatter TSP, Bottleneck TSP, Hamiltonian cycle/path, Optimization, Approximation algorithms, Matching
119Hans-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 IFIP TCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
105Hans-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 STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
103Ming Yang 0003, Zhou Kang, Lishan Kang A Parallel Multi-algorithm Solver for Dynamic Multi-Objective TSP (DMO-TSP). Search on Bibsonomy ICIC (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF dynamic multi-objective TSP, parallel multi-algorithm, Pareto optimal front
100Vladimir G. Deineko, Alexandre Tiskin One-Sided Monge TSP Is NP-Hard. Search on Bibsonomy ICCSA (3) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
91Fred W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich Construction Heuristics and Domination Analysis for the Asymmetric TSP. Search on Bibsonomy WAE The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
90Ming Yang 0003, Lishan Kang, Jing Guan An Evolutionary Algorithm for Dynamic Multi-Objective TSP. Search on Bibsonomy ISICA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF dynamic multi-objective TSP optimization, Paretos-Similarity, evolutionary algorithm
85Sejong Yoon, Saejoon Kim k-Top Scoring Pair Algorithm for feature selection in SVM with applications to microarray data classification. Search on Bibsonomy Soft Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Top Scoring Pair, k-TSP, SVM-RFE, SVM, Ensemble methods
81Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002 The Parameterized Approximability of TSP with Deadlines. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
71Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton Improved lower and upper bounds for universal TSP in planar metrics. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
71David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook TSP Cuts Which Do Not Conform to the Template Paradigm. Search on Bibsonomy Computational Combinatorial Optimization The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
62Youngkyu Park, Ho-Jin Choi, Jongmoon Baik A Framework for the Use of Six Sigma Tools in PSP/TSP. Search on Bibsonomy SERA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
62Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
62Béla Csaba, Marek Karpinski, Piotr Krysta Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
62Tinghong Zhao, Zibin Man, Xueyi Qi A MSM-PGA Based on Multi-agent for Solving TSP. Search on Bibsonomy ISIP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Agent union, MSM-PGA, Self-adaptive genetic algorithm, Multi-Agent, TSP
62Ranieri Baraglia, José Ignacio Hidalgo, Raffaele Perego 0001 A Parallel Hybrid Heuristic for the TSP. Search on Bibsonomy EvoWorkshops The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Lin-Kernighan algorithm, hybrid GA, Parallel algorithms, TSP, compact genetic algorithm
62Michelangelo Grigni Approximate TSP in Graphs with Forbidden Minors. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF TSP, separator, spanner, approximation scheme, graph minor, genus
61Sanjeev Arora Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems. Search on Bibsonomy FOCS The full citation details ... 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
58Shuqin Wang, Chunbao Zhou, Yingsi Wu, Jianxin Wang, Chunguang Zhou, Yanchun Liang 0001 A Novel Approach for Classifying Human Cancers. Search on Bibsonomy ICYCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
58Rae-Goo Kang, Chai-Yeoung Jung The Improved Initialization Method of Genetic Algorithm for Solving the Optimization Problem. Search on Bibsonomy ICONIP (3) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Genetic Algorithm, Optimization, Initialization, GA
55Zhi-Zhong Chen, Takayuki Nagoya Improved approximation algorithms for metric MaxTSP. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Max TSP, Metric Max TSP, Approximation Algorithms, Randomized Algorithms, TSP, Derandomization
52Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. Search on Bibsonomy AAIM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
52Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger Four point conditions and exponential neighborhoods for symmetric TSP. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
52Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002 On the Approximation Hardness of Some Generalizations of TSP. Search on Bibsonomy SWAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
52Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Approximation algorithms
52Helei Wu, Yirong Yang Application of continuous Hopfield network to solve the TSP. Search on Bibsonomy ICARCV The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
52Mikael Hammar, Bengt J. Nilsson Approximation Results for Kinetic Variants of TSP. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
52Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky Moving-Target TSP and Related Problems. Search on Bibsonomy ESA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
52Yasuhiro Tsujimura, Mitsuo Gen Entropy-based genetic algorithm for solving TSP. Search on Bibsonomy KES (2) The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
52Joseph S. B. Mitchell A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane. Search on Bibsonomy SCG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF approximation algorithm, TSP
52Yong-Qin Tao, Du-Wu Cui, Xianglin Miao, Hao Chen An Improved Swarm Intelligence Algorithm for Solving TSP Problem. Search on Bibsonomy ICIC (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF swarm intelligence algorithm, tsp, gene regulation
52István Borgulya An EC-memory based method for the multi-objective TSP. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF EC-memory, multi-objective optimization, TSP
52Roi Blanco, Alvaro Barreiro TSP and cluster-based solutions to the reassignment of document identifiers. Search on Bibsonomy Inf. Retr. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Document identifier reassignment, Clustering, Indexing, Compression, SVD, TSP
52Rae-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 PRICAI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Genetic Algorithm, TSP, Initialization, GA
50Sanjeev Arora Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. Search on Bibsonomy FOCS The full citation details ... 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
48Xiao-Bing Hu, Ezequiel A. Di Paolo A Hybrid Genetic Algorithm for the Travelling Salesman Problem. Search on Bibsonomy NICSO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
48Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. Search on Bibsonomy FSTTCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
48Jun Sakuma, Shigenobu Kobayashi A genetic algorithm for privacy preserving combinatorial optimization. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF privacy preserving optimization, security, privacy, TSP, GA
47José 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 Stat. Methods Appl. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF TSP distribution, mesokurtic, constant variance, PERT, Beta
43Sophie Toulouse, Roberto Wolfler Calvo On the Complexity of the Multiple Stack TSP, kSTSP. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
43T.-H. Hubert Chan, Anupam Gupta 0001 Approximating TSP on metrics with bounded global growth. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
43Michele Aicardi, Davide Giglio, Riccardo Minciardi Determination of optimal control strategies for TSP by dynamic programming. Search on Bibsonomy CDC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
43Mehrdad Nojoumian, Divya K. Nair Comparing genetic algorithm and guided local search methods by symmetric TSP instances. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF genetic algorithm, guided local search
43Marcin Czajkowski, Marek Kretowski Novel Extension of k-TSP Algorithm for Microarray Classification. Search on Bibsonomy IEA/AIE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
43Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo, Adrian Ion, Andreas Lehrbaum Approximating TSP Solution by MST Based Graph Pyramid. Search on Bibsonomy GbRPR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
43Vladimir G. Deineko, Alexandre Tiskin Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. Search on Bibsonomy WEA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
43Paula Cecilia Fritzsche, Dolores Rexachs, Emilio Luque A Computational Approach to TSP Performance Prediction Using Data Mining. Search on Bibsonomy AINA Workshops (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
43Yuichi Nagata New EAX Crossover for Large TSP Instances. Search on Bibsonomy PPSN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
43Shubhra Sankar Ray, Sanghamitra Bandyopadhyay, Sankar K. Pal New Genetic Operators for Solving TSP: Application to Microarray Gene Ordering. Search on Bibsonomy PReMI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
43Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters Approximation Algorithms for Euclidean Group TSP. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
43Thomas Fischer 0003, Peter Merz A Distributed Chained Lin-Kernighan Algorithm for TSP Problems. Search on Bibsonomy IPDPS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
43Chao-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 ICNC (2) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
43Thang Nguyen Bui, Mufit Colpan Solving geometric TSP with ants. Search on Bibsonomy GECCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF traveling salesman problem, ant system
43Wen-Lung Shu, Chen-Cheng Wu, Wei-Cheng Lai Design the Hardware of Genetic Algorithm for TSP and MSA. Search on Bibsonomy KES The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
43Tim Hendtlass TSP Optimisation Using Multi Tour Ants. Search on Bibsonomy IEA/AIE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF travelling salesperson problem, heuristic search, Ant colony optimisation
43Avrim Blum, Shuchi Chawla 0001, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff Approximation Algorithms for Orienteering and Discounted-Reward TSP. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
43Marcin L. Pilat, Tony White Using Genetic Algorithms to Optimize ACS-TSP. Search on Bibsonomy Ant Algorithms The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
43Lars Engebretsen, Marek Karpinski Approximation Hardness of TSP with Bounded Metrics. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
43Mikael Hammar, Bengt J. Nilsson Approximation Results for Kinetic Variants of TSP. Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
43Paula Cecilia Fritzsche, Dolores Rexachs, Emilio Luque A General Approach to Predict the Performance Order of TSP Family Problems. Search on Bibsonomy ICA3PP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Data-dependent algorithms, Parallel computing, TSP, Performance prediction
43Chengming Qi An Ant Colony System Hybridized with Randomized Algorithm for TSP. Search on Bibsonomy SNPD (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Combinatorial Optimization, Randomized Algorithm, TSP, Ant Colony System
43Birger Funke, Tore Grünert, Stefan Irnich A Note on Single Alternating Cycle Neighborhoods for the TSP. Search on Bibsonomy J. Heuristics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF edge-exchange neighborhoods, Lin-Kernighan, ejection chains, local search, TSP
43Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram Universal approximations for TSP, Steiner tree, and set cover. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF sparse partition, approximation algorithms, TSP, Steiner tree, set cover, universal approximation
42Cristian Marinescu, Nicolae Tapus Some Critical Aspects of the PKIX TSP. Search on Bibsonomy Communications and Multimedia Security The full citation details ... 2005 DBLP  DOI  BibTeX  RDF TSA, PKIX TSP, security, PKI, time-stamp
42María Auxilio Osorio Lama, David Pinto 0001 A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP. Search on Bibsonomy MICAI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF TSP problem, Surrogate Constraint Analysis, Preprocessing
38Lounell 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 ICRA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
38Guilherme De A. Barreto Time Series Prediction with the Self-Organizing Map: A Review. Search on Bibsonomy Perspectives of Neural-Symbolic Integration The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Wen-liang Zhong, Jun Zhang 0003, Wei-neng Chen A novel discrete particle swarm optimization to solve traveling salesman problem. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Michael Butts, Anthony Mark Jones, Paul Wasson A Structural Object Programming Model, Architecture, Chip and Tools for Reconfigurable Computing. Search on Bibsonomy FCCM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Ioannis Mavroidis, Ioannis Papaefstathiou, Dionisios N. Pnevmatikatos A Fast FPGA-Based 2-Opt Solver for Small-Scale Euclidean Traveling Salesman Problem. Search on Bibsonomy FCCM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Viswanath Nagarajan, R. Ravi 0001 Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom Biased Mutation Operators for Subgraph-Selection Problems. Search on Bibsonomy IEEE Trans. Evol. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Chun 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 IEEE Trans. Circuits Syst. Video Technol. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Peitsang Wu, Kung-Jiuan Yang, Hsin-Chieh Fang A Revised EM-Like Algorithm + K-OPT Method for Solving the Traveling Salesman Problem. Search on Bibsonomy ICICIC (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Yuichi Nagata Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems. Search on Bibsonomy EvoCOP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Bodo Manthey, L. Shankar Ram Approximation Algorithms for Multi-criteria Traveling Salesman Problems. Search on Bibsonomy WAOA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Huidang Zhang, Yuyao He Comparative Study of Chaotic Neural Networks with Different Models of Chaotic Noise. Search on Bibsonomy ICNC (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
38Vladimir G. Deineko, Michael Hoffmann 0001, Yoshio Okamoto, Gerhard J. Woeginger The Traveling Salesman Problem with Few Inner Points. Search on Bibsonomy COCOON The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
38Alessio Plebe An Effective Traveling Salesman Problem Solver Based on Self-Organizing Map. Search on Bibsonomy ICANN The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
38Gill Barequet, Matthew Dickerson, Michael T. Goodrich Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
38Lixin Yang, Deborah A. Stacey Solving the Traveling Salesman Problem Using the Enhanced Genetic Algorithm. Search on Bibsonomy AI The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
38Cristina G. Fernandes, Till Nierhoff The UPS Problem. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
38Jin-Wook Baek, Jae-Heung Yeo, Gyu-Tae Kim, Heon Young Yeom Cost Effective Mobile Agent Planning for Distributed Information Retrieval. Search on Bibsonomy ICDCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Mobile Agent Planning, Mobile Computing, Mobile Agents, Distributed Information Retrieval, Distributed Agent System
38Kay C. Wiese, Scott D. Goodwin, Sivakumar Nagarajan ASERC - A Genetic Sequencing Operator for Asymmetric Permutation Problems. Search on Bibsonomy AI The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
38Alberto Caprara, Matteo Fischetti, Adam N. Letchford On the Separation of Maximally Violated mod-k Cuts. Search on Bibsonomy IPCO The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
38Marcelo M. de Azevedo, Douglas M. Blough Multistep Interactive Convergence: An Efficient Approach to the Fault-Tolerant Clock Synchronization of Large Multicomputers. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF interactive convergence, fault tolerance, multicomputers, Clock synchronization
38Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger The Travelling Salesman and the PQ-Tree. Search on Bibsonomy IPCO The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Euclidean travelling salesman problem, PQ-tree, Dynamic programming, Combinatorial optimization, Travelling salesman problem, Polynomial algorithm
38Takuro Fukunaga, Hiroshi Nagamochi Network Design with Edge-Connectivity and Degree Constraints. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Degree constraint, (m,n)-VRP, Approximation algorithm, TSP, Vehicle routing problem, Edge-connectivity
38Priscila 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 BVAI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Higher-order Networks, Pseudo-Boolean Constraints, Simulated Annealing, TSP, Satisfiability, Graph Colouring
38Dong-il Seo, Byung Ro Moon Computing the epistasis variance of large-scale traveling salesman problems. Search on Bibsonomy GECCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF TSP, traveling salesman problem, linkage, epistasis
37Xiao-Feng Xie 0001, Jiming Liu 0001 How autonomy oriented computing (AOC) tackles a computationally hard optimization problem. Search on Bibsonomy AAMAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF autonomy oriented computing (AOC), search, multiagent system, global optimization, traveling salesman problem (TSP), emergent, cooperative problem solving, collective behavior
37Andreas Baltz, Tomasz Schoen, Anand Srivastav On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Asymmetric b-partite TSP, Assignment Problem
33Yi Liu, Shengwu Xiong, Hongbing Liu Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP. Search on Bibsonomy GEC Summit The full citation details ... 2009 DBLP  DOI  BibTeX  RDF adaptive, tabu search, simulated annealing algorithm
33Peter Merz, Jutta Huhse An Iterated Local Search Approach for Finding Provably Good Solutions for Very Large TSP Instances. Search on Bibsonomy PPSN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33David R. Karger, Jacob Scott 0001 Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Shubhra Sankar Ray, Sanghamitra Bandyopadhyay, Sankar K. Pal Genetic operators for combinatorial optimization in TSP and microarray gene ordering. Search on Bibsonomy Appl. Intell. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Gene analysis, Biocomputing, Data mining, Evolutionary algorithm, Microarray, Soft computing
33Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. Search on Bibsonomy CAAN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Lin-Kernighan Heuristic, Double Bridge Technique, Traveling Salesman Problem, Tolerances, Backbones
33Changsheng Zhang 0001, Jigui Sun, Yan Wang, Qingyun Yang An Improved Discrete Particle Swarm Optimization Algorithm for TSP. Search on Bibsonomy Web Intelligence/IAT Workshops The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33Shmuel Safra, Oded Schwartz On the complexity of approximating tsp with neighborhoods and related problems. Search on Bibsonomy Comput. Complex. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF 68Q25, Subject classification. 68Q17
33Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters On Approximating the TSP with Intersecting Neighborhoods. Search on Bibsonomy ISAAC The full citation details ... 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][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license