Data structures and ejection chains for solving large-scale traveling salesman problems

DOI10.1016/J.EJOR.2004.04.023zbMATH Open1067.90140OpenAlexW2161772518WikidataQ56017139 ScholiaQ56017139MaRDI QIDQ1887873FDOQ1887873

César Rego, Fred Glover, Dorabela Gamboa

Publication date: 22 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.04.023

zbMATH Keywords

Data structuresLocal searchTraveling salesmanEjection chains

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• TSPLIB—A Traveling Salesman Problem Library
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• Relaxed tours and path ejections for the traveling salesman problem
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• Data Structures for Traveling Salesmen
• A data structure useful for finding Hamiltonian cycles

Cited In (14)

• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• Data Structures for Traveling Salesmen
• Title not available (Why is that?)
• Further extension of the TSP assign neighborhood
• Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
• Traveling salesman problem heuristics: leading methods, implementations and latest advances
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
• Social structure optimization in team formation
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• Ejection chain and filter-and-fan methods in combinatorial optimization
• A \(k\)-level data structure for large-scale traveling salesman problems
• A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP

Uses Software

• TSPLIB
• DIMACS

This page was built for publication: Data structures and ejection chains for solving large-scale traveling salesman problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887873)