|
|
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. |
Algorithmica |
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. |
IFIP TCS |
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. |
STACS |
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). |
ICIC (2) |
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. |
ICCSA (3) |
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. |
WAE |
1999 |
DBLP DOI BibTeX RDF |
|
90 | Ming Yang 0003, Lishan Kang, Jing Guan |
An Evolutionary Algorithm for Dynamic Multi-Objective TSP. |
ISICA |
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. |
Soft Comput. |
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. |
Theory Comput. Syst. |
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. |
SODA |
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. |
Computational Combinatorial Optimization |
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. |
SERA |
2007 |
DBLP DOI BibTeX RDF |
|
62 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. |
FOCS |
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. |
SODA |
2002 |
DBLP BibTeX RDF |
|
62 | Tinghong Zhao, Zibin Man, Xueyi Qi |
A MSM-PGA Based on Multi-agent for Solving TSP. |
ISIP |
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. |
EvoWorkshops |
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. |
ICALP |
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. |
FOCS |
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. |
ICYCS |
2008 |
DBLP DOI BibTeX RDF |
|
58 | Rae-Goo Kang, Chai-Yeoung Jung |
The Improved Initialization Method of Genetic Algorithm for Solving the Optimization Problem. |
ICONIP (3) |
2006 |
DBLP DOI BibTeX RDF |
Genetic Algorithm, Optimization, Initialization, GA |
55 | Zhi-Zhong Chen, Takayuki Nagoya |
Improved approximation algorithms for metric MaxTSP. |
J. Comb. Optim. |
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. |
AAIM |
2009 |
DBLP DOI BibTeX RDF |
|
52 | Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger |
Four point conditions and exponential neighborhoods for symmetric TSP. |
SODA |
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. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithms |
52 | Helei Wu, Yirong Yang |
Application of continuous Hopfield network to solve the TSP. |
ICARCV |
2004 |
DBLP DOI BibTeX RDF |
|
52 | Mikael Hammar, Bengt J. Nilsson |
Approximation Results for Kinetic Variants of TSP. |
Discret. Comput. Geom. |
2002 |
DBLP DOI BibTeX RDF |
|
52 | Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky |
Moving-Target TSP and Related Problems. |
ESA |
1998 |
DBLP DOI BibTeX RDF |
|
52 | Yasuhiro Tsujimura, Mitsuo Gen |
Entropy-based genetic algorithm for solving TSP. |
KES (2) |
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. |
SCG |
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. |
ICIC (2) |
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. |
GECCO |
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. |
Inf. Retr. |
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. |
PRICAI |
2006 |
DBLP DOI BibTeX RDF |
Genetic Algorithm, TSP, Initialization, GA |
50 | Sanjeev Arora |
Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. |
FOCS |
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. |
NICSO |
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. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Jun Sakuma, Shigenobu Kobayashi |
A genetic algorithm for privacy preserving combinatorial optimization. |
GECCO |
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. |
Stat. Methods Appl. |
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. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
43 | T.-H. Hubert Chan, Anupam Gupta 0001 |
Approximating TSP on metrics with bounded global growth. |
SODA |
2008 |
DBLP BibTeX RDF |
|
43 | Michele Aicardi, Davide Giglio, Riccardo Minciardi |
Determination of optimal control strategies for TSP by dynamic programming. |
CDC |
2008 |
DBLP DOI BibTeX RDF |
|
43 | Mehrdad Nojoumian, Divya K. Nair |
Comparing genetic algorithm and guided local search methods by symmetric TSP instances. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
genetic algorithm, guided local search |
43 | Marcin Czajkowski, Marek Kretowski |
Novel Extension of k-TSP Algorithm for Microarray Classification. |
IEA/AIE |
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. |
GbRPR |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Vladimir G. Deineko, Alexandre Tiskin |
Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP. |
WEA |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Paula Cecilia Fritzsche, Dolores Rexachs, Emilio Luque |
A Computational Approach to TSP Performance Prediction Using Data Mining. |
AINA Workshops (1) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Yuichi Nagata |
New EAX Crossover for Large TSP Instances. |
PPSN |
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. |
PReMI |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters |
Approximation Algorithms for Euclidean Group TSP. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Thomas Fischer 0003, Peter Merz |
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems. |
IPDPS |
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. |
ICNC (2) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Thang Nguyen Bui, Mufit Colpan |
Solving geometric TSP with ants. |
GECCO |
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. |
KES |
2004 |
DBLP DOI BibTeX RDF |
|
43 | Tim Hendtlass |
TSP Optimisation Using Multi Tour Ants. |
IEA/AIE |
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. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
43 | Marcin L. Pilat, Tony White |
Using Genetic Algorithms to Optimize ACS-TSP. |
Ant Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Lars Engebretsen, Marek Karpinski |
Approximation Hardness of TSP with Bounded Metrics. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
43 | Mikael Hammar, Bengt J. Nilsson |
Approximation Results for Kinetic Variants of TSP. |
ICALP |
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. |
ICA3PP |
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. |
SNPD (3) |
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. |
J. Heuristics |
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. |
STOC |
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. |
Communications and Multimedia Security |
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. |
MICAI |
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. |
ICRA |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Guilherme De A. Barreto |
Time Series Prediction with the Self-Organizing Map: A Review. |
Perspectives of Neural-Symbolic Integration |
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. |
IEEE Congress on Evolutionary Computation |
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. |
FCCM |
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. |
FCCM |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Viswanath Nagarajan, R. Ravi 0001 |
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom |
Biased Mutation Operators for Subgraph-Selection Problems. |
IEEE Trans. Evol. Comput. |
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. |
IEEE Trans. Circuits Syst. Video Technol. |
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. |
ICICIC (1) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Yuichi Nagata |
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems. |
EvoCOP |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Bodo Manthey, L. Shankar Ram |
Approximation Algorithms for Multi-criteria Traveling Salesman Problems. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Huidang Zhang, Yuyao He |
Comparative Study of Chaotic Neural Networks with Different Models of Chaotic Noise. |
ICNC (1) |
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. |
COCOON |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Alessio Plebe |
An Effective Traveling Salesman Problem Solver Based on Self-Organizing Map. |
ICANN |
2002 |
DBLP DOI BibTeX RDF |
|
38 | Gill Barequet, Matthew Dickerson, Michael T. Goodrich |
Voronoi Diagrams for Convex Polygon-Offset Distance Functions. |
Discret. Comput. Geom. |
2001 |
DBLP DOI BibTeX RDF |
|
38 | Lixin Yang, Deborah A. Stacey |
Solving the Traveling Salesman Problem Using the Enhanced Genetic Algorithm. |
AI |
2001 |
DBLP DOI BibTeX RDF |
|
38 | Cristina G. Fernandes, Till Nierhoff |
The UPS Problem. |
STACS |
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. |
ICDCS |
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. |
AI |
2000 |
DBLP DOI BibTeX RDF |
|
38 | Alberto Caprara, Matteo Fischetti, Adam N. Letchford |
On the Separation of Maximally Violated mod-k Cuts. |
IPCO |
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. |
IEEE Trans. Parallel Distributed Syst. |
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. |
IPCO |
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. |
Theory Comput. Syst. |
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. |
BVAI |
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. |
GECCO |
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. |
AAMAS |
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. |
RANDOM-APPROX |
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. |
GEC Summit |
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. |
PPSN |
2008 |
DBLP DOI BibTeX RDF |
|
33 | David R. Karger, Jacob Scott 0001 |
Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP. |
APPROX-RANDOM |
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. |
Appl. Intell. |
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. |
CAAN |
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. |
Web Intelligence/IAT Workshops |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Shmuel Safra, Oded Schwartz |
On the complexity of approximating tsp with neighborhoods and related problems. |
Comput. Complex. |
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. |
ISAAC |
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][ >>] |
|