Search results for "traveling-salesman-problem"

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