The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase traveling salesman problem (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1954-1973 (15) 1974-1978 (18) 1979-1983 (16) 1984-1986 (16) 1987-1989 (18) 1990 (18) 1991-1992 (24) 1993 (16) 1994 (17) 1995 (23) 1996 (21) 1997 (16) 1998 (33) 1999 (37) 2000 (44) 2001 (36) 2002 (54) 2003 (42) 2004 (57) 2005 (75) 2006 (85) 2007 (103) 2008 (91) 2009 (86) 2010 (61) 2011 (53) 2012 (80) 2013 (54) 2014 (65) 2015 (70) 2016 (63) 2017 (81) 2018 (84) 2019 (20)
Publication types (Num. hits)
article(799) incollection(17) inproceedings(762) phdthesis(14)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 622 occurrences of 333 keywords

Results
Found 1592 publication records. Showing 1592 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
152Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem. Search on Bibsonomy Optimization Letters The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Expanding neighborhood search-GRASP, Probabilistic traveling salesman problem, Metaheuristics
150Gerold Jäger, Paul Molitor Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Traveling Salesman Problem of Second Order, Heuristic, Traveling Salesman Problem, Exact Algorithm, Assignment Problem
143Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis Not Every GTSP Facet Induces an STSP Facet. Search on Bibsonomy IPCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Graphical Traveling Salesman Problem, Symmetric Traveling Salesman Problem, polyhedral computation, facets, polyhedral combinatorics
125Heinrich Braun On Solving Travelling Salesman Problems by Genetic Algorithms. Search on Bibsonomy PPSN The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
116C. E. Miller, A. W. Tucker, R. A. Zemlin Integer Programming Formulation of Traveling Salesman Problems. Search on Bibsonomy J. ACM The full citation details ... 1960 DBLP  DOI  BibTeX  RDF
116He Jiang, Xianchao Zhang, Mingchu Li, HaoYang Che Using Gavish-Grave LP to Formulate the Directed Black and White Traveling Salesman Problem. Search on Bibsonomy International Conference on Computational Science (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Black and white traveling salesman problem, Gavish-Grave LP, Linear programming
115Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Quan-Qe Pan A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF discrete particle swarm optimization problem, generalized traveling salesman problem, iterated greedy algorithm, variable neighborhood descend algorithm
115Jonatan Gómez, Roberto Poveda, Elizabeth León Grisland: a parallel genetic algorithm for finding near optimal solutions to the traveling salesman problem. Search on Bibsonomy GECCO (Companion) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF traveling salesman problem, parallel genetic algorithms
99Prasanna Balaprakash, Mauro Birattari, Thomas Stützle, Zhi Yuan, Marco Dorigo Estimation-based ant colony optimization and local search for the probabilistic traveling salesman problem. Search on Bibsonomy Swarm Intelligence The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Empirical estimation, Estimation-based local search, Probabilistic traveling salesman problem, Ant colony optimization
97Dragos Cvetkovic, Mirjana Cangalovic, Vera Kovacevic-Vujcic Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem. Search on Bibsonomy IPCO The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Traveling salesman problem, Semidefinite programming, Branch-and-bound methods
96Xiaoxia Zhang, Lixin Tang A New Hybrid Ant Colony Optimization Algorithm for the Traveling Salesman Problem. Search on Bibsonomy ICIC (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Ant colony optimization, traveling salesman problem, path relinking
96Héctor Sanvicente Sánchez, Juan Frausto Solís MPSA: A Methodology to Parallelize Simulated Annealing and Its Application to the Traveling Salesman Problem. Search on Bibsonomy MICAI The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Parallel Algorithms and Traveling Salesman Problem, Simulated Annealing, Combinatorial Optimization
96Joachim Giesen Curve Reconstruction in Arbitrary Dimension and the Traveling Salesman Problem. Search on Bibsonomy DGCI The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Traveling Salesman Problem, Minimum Spanning Tree, Curve Reconstruction
92María Luisa Pérez-Delgado, Juan C. Matos-Franco Self-organizing Feature Maps to Solve the Undirected Rural Postman Problem. Search on Bibsonomy EUROCAST The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Rural Postman Problem, Traveling Salesman Problem, Self-organizing Feature Maps
90Tony White, Simon Kaegi, Terri Oda Revisiting Elitism in Ant Colony Optimization. Search on Bibsonomy GECCO The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Ant Colony Optimization, Traveling Salesman Problem, Heuristic Search, Ant Algorithm, Ant System
85Bin Hu 0004, Günther R. Raidl Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem. Search on Bibsonomy HIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Transformation, Traveling Salesman Problem, Network Design
82Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar, Dumitru Dumitrescu A Bio-Inspired Approach for a Dynamic Railway Problem. Search on Bibsonomy SYNASC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
81Peter Brucker, Sigrid Knust Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. Search on Bibsonomy Annals OR The full citation details ... 2002 DBLP  DOI  BibTeX  RDF traveling salesman problem with time windows, scheduling, lower bounds, constraint propagation, column generation, time-lags
81Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos Algorithms for the On-Line Quota Traveling Salesman Problem. Search on Bibsonomy COCOON The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
80Lijie Li, Ying Zhang An Improved Genetic Algorithm for the Traveling Salesman Problem. Search on Bibsonomy ICIC (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF 2opt, 2- exchange crossover heuristic, the rule of 5, Traveling Salesman Problem, K-Nearest Neighbor, Hybrid Genetic Algorithm
80Laleh Haerian Ardekani, Tiru S. Arthanari Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration. Search on Bibsonomy MCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Pedigree polytope, Multistage insertion formulation, Membership problem, Combinatorial optimization, Traveling salesman problem
80Pawel Jan Kalczynski, Jerzy Kamburowski Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem. Search on Bibsonomy J. Scheduling The full citation details ... 2005 DBLP  DOI  BibTeX  RDF stochastic flow shop, two machines, expected makespan, Monge matrix, traveling salesman problem, sequencing, blocking
79Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank The Traveling Salesman Problem in Graphs with 3-Edge Cutsets Search on Bibsonomy J. ACM The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
79Márk Farkas, Péter Földesi, János Botzheim, László T. Kóczy Approximation of a Modified Traveling Salesman Problem Using Bacterial Memetic Algorithms. Search on Bibsonomy Towards Intelligent Engineering and Information Technology The full citation details ... 2009 DBLP  DOI  BibTeX  RDF time dependent fuzzy costs, eugenic hanbacterial memetic algorithm, Traveling Salesman Problem
79Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chong A Bee Colony Optimization Algorithm for Traveling Salesman Problem. Search on Bibsonomy Asia International Conference on Modelling and Simulation The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Bee Colony Optimization, Combinatorial Optimization, Traveling Salesman Problem, Computational Intelligence
79Bin Hu 0004, Günther R. Raidl Effective Neighborhood Structures for the Generalized Traveling Salesman Problem. Search on Bibsonomy EvoCOP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Generalized Traveling Salesman Problem, Network Design, Variable Neighborhood Search
79Marcos Villagra, Benjamín Barán, Osvaldo Gómez Global Convexity in the Bi-Criteria Traveling Salesman Problem. Search on Bibsonomy IFIP AI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Global Convexity, Multi-Objective Optimization, Traveling Salesman Problem
79Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe The geometric maximum traveling salesman problem. Search on Bibsonomy J. ACM The full citation details ... 2003 DBLP  DOI  BibTeX  RDF maximum scatter TSP, polyhedral metric, optimization, NP-hardness, Traveling salesman problem, polynomial time, Euclidean metric
78Serban Iordache Consultant-guided search combined with local search for the traveling salesman problem. Search on Bibsonomy GECCO (Companion) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF combinatorial optimization, swarm intelligence, traveling salesman problem, metaheuristics
78Xuan Wang, Gan-nian Zhang, Yuan-xiang Li Solving Traveling Salesman Problem by Using an Evolutionary Algorithm Based on the Local Search Strategy. Search on Bibsonomy ISNN (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Local search Strategy, Evolutionary algorithm, Traveling salesman problem
78Darrell Whitley, Doug Hains, Adele E. Howe Tunneling between optima: partition crossover for the traveling salesman problem. Search on Bibsonomy GECCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF traveling salesman problem, fitness landscape, recombination
78Jia Ma, Tao Yang 0011, Zeng-Guang Hou, Min Tan 0001, Derong Liu 0001 Neurodynamic programming: a case study of the traveling salesman problem. Search on Bibsonomy Neural Computing and Applications The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Neurodynamic programming, Approximate Sarsa, Traveling salesman problem, Temporal difference learning
78Zhu Qiang A New Co-evolutionary Genetic Algorithm for Traveling Salesman Problem. Search on Bibsonomy ISECS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF convergence, traveling salesman problem, schemata
78David Spetzler, Fusheng Xiong, Wayne D. Frasch Heuristic Solution to a 10-City Asymmetric Traveling Salesman Problem Using Probabilistic DNA Computing. Search on Bibsonomy DNA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Ligation, Denaturing PAGE, Magnetic affinity, Traveling Salesman Problem, Hybridization, DNA computing
78Xinmei Liu, Jinrong Su, Yan Han An Improved Particle Swarm Optimization for Traveling Salesman Problem. Search on Bibsonomy ICIC (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Particle swarm optimization, Traveling salesman problem, Greedy algorithm, Mutation, Crossover
78Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos A Hybrid Genetic-GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF genetic algorithms, traveling salesman problem, metaheuristics, Lagrangean Relaxation, greedy randomized adaptive search procedure
78Weiqi Li Dynamics of Local Search Trajectory in Traveling Salesman Problem. Search on Bibsonomy J. Heuristics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF dynamical complexity, heuristics, local search, traveling salesman problem
78François-Xavier Le Louarn, Michel Gendreau, Jean-Yves Potvin GENI Ants for the Traveling Salesman Problem. Search on Bibsonomy Annals OR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF generalized insertion, traveling salesman problem, ant colony system
78Luciana S. Buriol, Paulo M. França, Pablo Moscato A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem. Search on Bibsonomy J. Heuristics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF local search, metaheuristics, memetic algorithms, asymmetric traveling salesman problem
73Markus Bläser, Bodo Manthey Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Approximation algorithms, Combinatorial optimization, Traveling salesman problem, Inapproximability, Cycle covers
73Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie The Online-TSP against Fair Adversaries. Search on Bibsonomy CIAC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
72Boris Goldengorin, Gerold Jäger, Paul Molitor Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. Search on Bibsonomy CAAN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Construction Heuristics, Traveling Salesman Problem, Tolerances
72Hoang Trung Dinh, Abdullah Al Mamun, Hieu T. Dinh Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms. Search on Bibsonomy AAIM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Ant Colony Optimization, Traveling Salesman Problem, Combinatorial Optimization Problem, Ant System
72Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura The On-line Asymmetric Traveling Salesman Problem. Search on Bibsonomy WADS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
72Georgia Hadjicharalambous, Petrica C. Pop, Evangelia Pyrga, George Tsaggouris, Christos D. Zaroliagis The Railway Traveling Salesman Problem. Search on Bibsonomy ATMOS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
72Susan N. Twohig, Samuel O. Aletan The Traveling-Salesman Problem (Abstract). Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
71Stephen Chen 0001, Gregory Pitt The Coordination of Parallel Search with Common Components. Search on Bibsonomy IEA/AIE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Combinatorial Optimization and Traveling Salesman Problem, Genetic Algorithms, Parallel Algorithms, Simulated Annealing, Heuristic Search
71Petrica C. Pop, Camelia-Mihaela Pintea, Corina Pop Sitar An Ant-Based Heuristic for the Railway Traveling Salesman Problem. Search on Bibsonomy EvoWorkshops The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
71Dimitrios A. Andreou Optimization of the traveling sequence of a "pick and place" robot by simulating its operation as a traveling salesman problem. Search on Bibsonomy Annual Simulation Symposium The full citation details ... 1988 DBLP  BibTeX  RDF
63Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Quan-Qe Pan, Yun-Chia Liang A genetic algorithm for the generalized traveling salesman problem. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
63Jorge Riera-Ledesma, Juan José Salazar González Solving the asymmetric traveling purchaser problem. Search on Bibsonomy Annals OR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Traveling purchaser problem, Heuristics, Traveling salesman problem, Branch-and-cut
62Agustín Bompadre, James B. Orlin Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems. Search on Bibsonomy IPCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
62Yinghui Zhang, Zhiwei Wang, Qinghua Zeng, Haolei Yang, Zhihua Wang Application of the Agamogenetic Algorithm to Solve the Traveling Salesman Problem. Search on Bibsonomy LSMS (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
62Amilkar Puris, Rafael Bello, Yailen Martínez, Ann Nowé Two-Stage Ant Colony Optimization for Solving the Traveling Salesman Problem. Search on Bibsonomy IWINAC (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
62Gregory Z. Gutin, Daniel Karapetyan, Natalio Krasnogor Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem. Search on Bibsonomy NICSO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
62Jyh-Da Wei, D. T. Lee Priority-Based Genetic Local Search and Its Application to the Traveling Salesman Problem. Search on Bibsonomy SEAL The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
62David Eppstein The Traveling Salesman Problem for Cubic Graphs. Search on Bibsonomy WADS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
62Donald Sofge, Alan C. Schultz, Kenneth DeJong Evolutionary Computational Approaches to Solving the Multiple Traveling Salesman Problem Using a Neighborhood Attractor Schema. Search on Bibsonomy EvoWorkshops The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
61Jinhui Xu 0001, Yang Yang 0012, Zhiyong Lin Traveling Salesman Problem of Segments. Search on Bibsonomy COCOON The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
61Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto Marchetti-Spaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
60Xiang Feng, Francis C. M. Lau 0001, Daqi Gao A New Bio-inspired Approach to the Traveling Salesman Problem. Search on Bibsonomy Complex (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF mosquito host-seeking algorithm (MHSA), distributed and parallel algorithm, traveling salesman problem (TSP), Bio-inspired algorithm
60Zixuan Hong, Fuling Bian Novel Ant Colony Optimization for Solving Traveling Salesman Problem in Congested Transportation System. Search on Bibsonomy PACIIA (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF ant colony optimization, traveling salesman problem, multidimensional scaling, transportation
60Vladimir G. Deineko, George Steiner, Zhihui Xue Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF robotic-cell scheduling, permuted Monge matrix, traveling salesman problem, polynomial-time algorithm
60Kengo Katayama, Hiroyuki Narihisa A New Iterated Local Search Algorithm Using Genetic Crossover for the Traveling Salesman Problem. Search on Bibsonomy SAC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF distance preserving crossover, double-bridge, escape technique, genetic iterated local search, traveling salesman problem
60Rainer E. Burkard, Vladimir G. Deineko Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood. Search on Bibsonomy Computing The full citation details ... 1995 DBLP  DOI  BibTeX  RDF subtour patching, Monge matrix, Traveling salesman problem
60Bryant A. Julstrom Very greedy crossover in a genetic algorithm for the traveling salesman problem. Search on Bibsonomy SAC The full citation details ... 1995 DBLP  DOI  BibTeX  RDF genetic algorithms, traveling salesman problem, crossover operators
60Shirish Bhide, Nigel M. John, Mansur R. Kabuka A Boolean Neural Network Approach for the Traveling Salesman Problem. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1993 DBLP  DOI  BibTeX  RDF Boolean neural network, simulation, scheduling, real-time systems, real-time systems, computational complexity, simulated annealing, combinatorial optimization, Boolean functions, traveling salesman problem, neural nets, job scheduling, NP-complete problems, noise immunity, hardware complexity, simulated annealing algorithm
60Jean Fonlupt, Armand Nachef Dynamic Programming and the Graphical Traveling Salesman Problem. Search on Bibsonomy J. ACM The full citation details ... 1993 DBLP  DOI  BibTeX  RDF dynamic programming, combinatorial optimization, graph, traveling salesman problem
58Keki B. Irani, Suk I. Yoo A Methodology for Solving Problems: Problem Modeling and Heuristic Generation. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF problem modeling, heuristic generation, robot planning problem, labeling problem, methodology, problem solving, problem solving, traveling salesman problem
56Antonio LaTorre, José María Peña Sánchez, Víctor Robles, Santiago Muelas Using multiple offspring sampling to guide genetic algorithms to solve permutation problems. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF hybrid evolutionary methods, multiple offspring sampling, genetic algorithms, traveling salesman problem, permutation problems
56Dong-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
56Matthew Andrews, Michael A. Bender, Lisa Zhang New Algorithms for Disk Scheduling. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Approximation algorithms, Disk scheduling, Asymmetric Traveling Salesman Problem
56Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo Algorithms for the On-Line Travelling Salesman. Search on Bibsonomy Algorithmica The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Approximation algorithms, Disk scheduling, Asymmetric Traveling Salesman Problem
56Vincenzo Bonifaci, Leen Stougie Online k-Server Routing Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Server routing, Traveling repairman, Online algorithms, Competitive analysis, Traveling salesman
56Vincenzo Bonifaci, Leen Stougie Online k-Server Routing Problems. Search on Bibsonomy WAOA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
55Gürsel Serpen Hopfield Network as Static Optimizer: Learning the Weights and Eliminating the Guesswork. Search on Bibsonomy Neural Processing Letters The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Static optimization, Liapunov function, Computational complexity, Adaptation, Learning, Training, Traveling salesman problem, Weights, Gradient descent, Hopfield neural network, Combinatorial
55Christophe Philemotte, Hugues Bersini A gestalt genetic algorithm: less details for better search. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF genetic algorithm, traveling salesman problem, gestalt
55Roger Z. Ríos-Mercado, Jonathan F. Bard The Flow Shop Scheduling Polyhedron with Setup Time. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF facet-defining inequalities, polyhedral combinatorics, setup times, flow shop scheduling, asymmetric traveling salesman problem, linear ordering problem
55Lars Engebretsen An Explicit Lower Bound for TSP with Distances One and Two. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
55Claudia Archetti, Alain Hertz, Maria Grazia Speranza Metaheuristics for the team orienteering problem. Search on Bibsonomy J. Heuristics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Team orienteering problem, Selective traveling salesman problem, Tabu search heuristic, Variable neighborhood search heuristic
55Xiao-Feng Xie, 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
55Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo Improving table compression with combinatorial optimization. Search on Bibsonomy J. ACM The full citation details ... 2003 DBLP  DOI  BibTeX  RDF table compression, dynamic programming, experimental algorithmics, Asymmetric traveling salesman problem
54Shmuel Safra, Oded Schwartz On the complexity of approximating tsp with neighborhoods and related problems. Search on Bibsonomy Computational Complexity The full citation details ... 2006 DBLP  DOI  BibTeX  RDF 68Q25, Subject classification. 68Q17
54Bodo Manthey, L. Shankar Ram Approximation Algorithms for Multi-Criteria Traveling Salesman Problems. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, Traveling salesman problem, Multi-criteria optimization
54Malay Bhattacharyya 0001, Anup Kumar Bandyopadhyay On single courier problem. Search on Bibsonomy Optimization Letters The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Courier problems, Single courier problem, Optimality principle, Traveling salesman problem
54Davide Bilò, Luca Forlizzi, Guido Proietti Approximating the Metric TSP in Linear Time. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Metric Graphs, Linear-time Approximation Algorithms, NP-hardness, Traveling Salesman Problem
54Gregory Z. Gutin, Fred Glover Further Extension of the TSP Assign Neighborhood. Search on Bibsonomy J. Heuristics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF exponential neighborhood, assign neighborhood, local search, traveling salesman problem
54Gang Peng, Ichiro Iimura, Takeshi Nakatsuru, Shigeru Nakayama Efficiency of Local Genetic Algorithm in Parallel Processing. Search on Bibsonomy PDCAT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF parallel GA, global GA, local GA, object shared space, Traveling Salesman Problem, genetic algorithm (GA)
54Björn Brodén, Mikael Hammar, Bengt J. Nilsson Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF The traveling salesman problem, The orienteering problem, Online algorithms, Time dependencies
54Duy Huynh Slide Edge Algorithm. Search on Bibsonomy SAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF neighborhood search technique, slide edge algorithm, evolutionary algorithm, traveling salesman problem, computational optimization
54Nihar R. Mahapatra, Shantanu Dutt Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF duplicate pruning, isoefficiency function, parallel A*, scalability, traveling salesman problem, communication delay, k-ary n-cubes, graph search, A* algorithm, branch-and-bound search
54Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth Exact Solution of Large Scale Asymmetric Travelling Salesman Problems. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF reduction procedure, subtour elimination, branch and bound, assignment problem, asymmetric traveling salesman problem
54Kenneth Rose, Eitan Gurewitz, Geoffrey C. Fox Constrained Clustering as an Optimization Method. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF cluster mass variables, total mass constraint, second Lagrange multiplier, open path constraint, optimization, pattern recognition, pattern recognition, simulated annealing, information theory, dimensionality reduction, unsupervised learning, traveling salesman problem, neural nets, neural nets, maximum entropy, phase transitions, deterministic annealing, constraint theory, constrained clustering, elastic net
54Yanyan Zhang, Lixin Tang Solving Prize-Collecting Traveling Salesman Problem with Time Windows by Chaotic Neural Network. Search on Bibsonomy ISNN (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
53Serban Iordache Consultant-guided search: a new metaheuristic for combinatorial optimization problems. Search on Bibsonomy GECCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF combinatorial optimization, swarm intelligence, traveling salesman problem, metaheuristics
53María Luisa Pérez-Delgado, J. Escuadra Burrieza A Post-optimization Method to Improve the Ant Colony System Algorithm. Search on Bibsonomy IWANN (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Dynamic Programming, Traveling Salesman Problem, Ant Colony System
53Shih Yu Chang, Hsiao-Chun Wu, Ai-Chun Pang Theoretical exploration of pattern attributes for maximum-length shift-register sequences. Search on Bibsonomy IWCMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF berlekamp's algorithm, pattern attribute, finite fields, traveling salesman problem, m-sequences
53Dan E. Tamir, Natan T. Shaked, Wilhelmus J. Geerts, Shlomi Dolev Combinatorial Optimization Using Electro-Optical Vector by Matrix Multiplication Architecture. Search on Bibsonomy OSC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF The Traveling Salesman Problem, Genetic Algorithms, Parallel Processing, Combinatorial Optimization, Heuristic Search, Hill Climbing, Optical Computing
53Pablo Rabanal, Ismael Rodríguez, Fernando Rubio 0001 Using River Formation Dynamics to Design Heuristic Algorithms. Search on Bibsonomy UC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Nature-based Algorithms, Ant Colony Optimization Algorithms, Traveling Salesman Problem, Heuristic Algorithms
53Chuan-Kang Ting Multi-parent extension of edge recombination. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF edge recombination, the traveling salesman problem, genetic algorithms, multi-parent crossover
Displaying result #1 - #100 of 1592 (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 Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license