Search results for "Lin-Kernighan"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
122	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
103	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
103	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
98	Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos	Multiple phase neighborhood Search - GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	ENS, Lagrangean relaxation and subgradient optimization, TSP, Metaheuristics, GRASP
98	Shun Motohashi, Takafumi Matsuura, Tohru Ikeguchi, Kazuyuki Aihara	The Lin-Kernighan Algorithm Driven by Chaotic Neurodynamics for Large Scale Traveling Salesman Problems.	ICANN (2)	2009	DBLP DOI BibTeX RDF
72	Talal Bonny, Jörg Henkel	Using Lin-Kernighan algorithm for look-up table compression to improve code density.	ACM Great Lakes Symposium on VLSI	2006	DBLP DOI BibTeX RDF	embedded systems, code compression, huffman coding
72	Thomas Fischer 0003, Peter Merz	A Distributed Chained Lin-Kernighan Algorithm for TSP Problems.	IPDPS	2005	DBLP DOI BibTeX RDF
52	Dirk Sudholt	Memetic algorithms with variable-depth search to overcome local optima.	GECCO	2008	DBLP DOI BibTeX RDF	Kernighan-Lin, variable-depth search, simulated annealing, combinatorial optimization, memetic algorithms, runtime analysis
52	Andrew B. Kahng, Xu Xu 0001	Local unidirectional bias for cutsize-delay tradeoff in performance-driven bipartitioning.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2004	DBLP DOI BibTeX RDF
45	Xinye Cai, Kang Wang, Yi Mei 0001, Zhenhua Li 0005, Jun Zhao 0004, Qingfu Zhang 0001	Decomposition-Based Lin-Kernighan Heuristic With Neighborhood Structure Transfer for Multi/Many-Objective Traveling Salesman Problem.	IEEE Trans. Evol. Comput.	2023	DBLP DOI BibTeX RDF
45	Qi Wang 0044, Chengwei Zhang, Chunlei Tang	Discovering Lin-Kernighan-Helsgaun heuristic for routing optimization using self-supervised reinforcement learning.	J. King Saud Univ. Comput. Inf. Sci.	2023	DBLP DOI BibTeX RDF
45	Jiongzhi Zheng, Kun He 0001, Jianrong Zhou, Yan Jin 0005, Chu-Min Li	Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems.	Knowl. Based Syst.	2023	DBLP DOI BibTeX RDF
45	Mingfei Li, Shikui Tu, Lei Xu 0001	Generalizing Graph Network Models for the Traveling Salesman Problem with Lin-Kernighan-Helsgaun Heuristics.	ICONIP (1)	2023	DBLP DOI BibTeX RDF
45	Jiongzhi Zheng, Kun He 0001, Jianrong Zhou, Yan Jin 0005, Chu-Min Li	Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems.	CoRR	2022	DBLP DOI BibTeX RDF
45	Liang Xin, Wen Song, Zhiguang Cao, Jie Zhang 0002	NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem.	CoRR	2021	DBLP BibTeX RDF
45	Jiongzhi Zheng, Kun He 0001, Jianrong Zhou, Yan Jin 0005, Chu-Min Li	Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem.	AAAI	2021	DBLP DOI BibTeX RDF
45	Liang Xin, Wen Song, Zhiguang Cao, Jie Zhang 0002	NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem.	NeurIPS	2021	DBLP BibTeX RDF
45	Jiongzhi Zheng, Kun He 0001, Jianrong Zhou, Yan Jin 0005, Chu-Min Li	Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem.	CoRR	2020	DBLP BibTeX RDF
45	Xianghui Zhong	On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP.	ESA	2020	DBLP DOI BibTeX RDF
45	Xianghui Zhong	On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric TSP.	CoRR	2019	DBLP BibTeX RDF
45	Andre Bevilaqua, Diego Bevilaqua, Keiji Yamanaka	Parallel island based Memetic Algorithm with Lin-Kernighan local search for a real-life Two-Echelon Heterogeneous Vehicle Routing Problem based on Brazilian wholesale companies.	Appl. Soft Comput.	2019	DBLP DOI BibTeX RDF
45	Emerson B. de Carvalho, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg	A Multi-objective Version of the Lin-Kernighan Heuristic for the Traveling Salesman Problem.	RITA	2018	DBLP DOI BibTeX RDF
45	Renato Tinós, Keld Helsgaun, L. Darrell Whitley	Efficient Recombination in the Lin-Kernighan-Helsgaun Traveling Salesman Heuristic.	PPSN (1)	2018	DBLP DOI BibTeX RDF
45	Keld Helsgaun	Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun Algorithm.	Math. Program. Comput.	2015	DBLP DOI BibTeX RDF
45	Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David A. Bader	A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents.	COCOON	2014	DBLP DOI BibTeX RDF
45	Ravi Kothari, Diptesh Ghosh	Insertion based Lin-Kernighan heuristic for single row facility layout.	Comput. Oper. Res.	2013	DBLP DOI BibTeX RDF
45	Doug Hains, L. Darrell Whitley, Adele E. Howe	Improving Lin-Kernighan-Helsgaun with Crossover on Clustered Instances of the TSP.	PPSN (2)	2012	DBLP DOI BibTeX RDF
45	Yu-Ting Wang 0003, Junqing Li 0001, Kaizhou Gao, Quan-Ke Pan	Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem.	Comput. Math. Appl.	2011	DBLP DOI BibTeX RDF
45	Daniel Karapetyan, Gregory Z. Gutin	Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem.	Eur. J. Oper. Res.	2011	DBLP DOI BibTeX RDF
45	Jian Sun 0006, Yuting Wang 0003, Junqing Li 0001, Kaizhou Gao	Hybrid algorithm based on Chemical Reaction Optimization and Lin-Kernighan local search for the Traveling Salesman Problem.	ICNC	2011	DBLP DOI BibTeX RDF
45	Daniel Karapetyan, Gregory Z. Gutin	Lin-Kernighan Heuristic Adaptation for the Generalized Traveling Salesman Problem	CoRR	2010	DBLP BibTeX RDF
45	Keld Helsgaun	General k-opt submoves for the Lin-Kernighan TSP heuristic.	Math. Program. Comput.	2009	DBLP DOI BibTeX RDF
45	Hung Dinh Nguyen, Ikuo Yoshihara, Kunihito Yamamori, Moritoshi Yasunaga	A New Three-Level Tree Data Structure for Representing TSP Tours in the Lin-Kernighan Heuristic.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2007	DBLP DOI BibTeX RDF
45	Thomas Fischer 0003, Peter Merz	Embedding a Chained Lin-Kernighan Algorithm into a Distributed Algorithm.	Metaheuristics	2007	DBLP DOI BibTeX RDF
45	David L. Applegate, William J. Cook, André Rohe	Chained Lin-Kernighan for Large Traveling Salesman Problems.	INFORMS J. Comput.	2003	DBLP DOI BibTeX RDF
45	Keld Helsgaun	An effective implementation of the Lin-Kernighan traveling salesman heuristic.	Eur. J. Oper. Res.	2000	DBLP DOI BibTeX RDF
45	David M. Neto	Efficient cluster compensation for Lin-Kernighan heuristics.		1999	RDF
45	King-Tim Mak, Andrew J. Morton	A modified Lin-Kernighan traveling-salesman heuristic.	Oper. Res. Lett.	1993	DBLP DOI BibTeX RDF
45	M. G. A. Verhoeven, Emile H. L. Aarts	A Parallel Lin-Kernighan Algorithm for the Travelling Salesman Problem.	PARCO	1993	DBLP BibTeX RDF
45	Christos H. Papadimitriou	The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem.	SIAM J. Comput.	1992	DBLP DOI BibTeX RDF
26	Matthias Prandtstetter, Günther R. Raidl	Combining Forces to Reconstruct Strip Shredded Text Documents.	Hybrid Metaheuristics	2008	DBLP DOI BibTeX RDF
26	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
26	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
26	Hung Dinh Nguyen, Ikuo Yoshihara, Kunihito Yamamori, Moritoshi Yasunaga	Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems.	IEEE Trans. Syst. Man Cybern. Part B	2007	DBLP DOI BibTeX RDF
26	Junghoon Lee, Eui-young Kang, Gyung-Leen Park	Design and Implementation of a Tour Planning System for Telematics Users.	ICCSA (3)	2007	DBLP DOI BibTeX RDF
26	Yuichi Nagata	Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems.	EvoCOP	2006	DBLP DOI BibTeX RDF
26	Jano I. van Hemert	Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution.	EvoCOP	2005	DBLP DOI BibTeX RDF
26	Huai-Kuang Tsai, Jinn-Moon Yang, Yuan-Fang Tsai, Cheng-Yan Kao	An evolutionary algorithm for large traveling salesman problems.	IEEE Trans. Syst. Man Cybern. Part B	2004	DBLP DOI BibTeX RDF
26	Jano I. van Hemert, Neil Urquhart	Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation.	PPSN	2004	DBLP DOI BibTeX RDF
26	Hamidreza Hashempour, Fabrizio Lombardi	Evaluation of heuristic techniques for test vector ordering.	ACM Great Lakes Symposium on VLSI	2004	DBLP DOI BibTeX RDF	test vector ordering, compression, SoC, power consumption, ATE, test data
26	Abraham P. Punnen, François Margot, Santosh N. Kabadi	TSP Heuristics: Domination Analysis and Complexity.	Algorithmica	2003	DBLP DOI BibTeX RDF
26	Norihiro Kubo, Shinichi Shimozono, Katsuhiro Muramoto	A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane.	ISAAC	2000	DBLP DOI BibTeX RDF
26	Nico L. J. Ulder, Emile H. L. Aarts, Hans-Jürgen Bandelt, Peter J. M. van Laarhoven, Erwin Pesch	Genetic Local Search Algorithms for the Travelling Salesman Problem.	PPSN	1990	DBLP DOI BibTeX RDF