Extended neighborhood: Definition and characterization
From MaRDI portal
Publication:1764249
DOI10.1007/s10107-003-0497-0zbMath1073.90036OpenAlexW2048933432WikidataQ59592524 ScholiaQ59592524MaRDI QIDQ1764249
James B. Orlin, Dushyant Sharma
Publication date: 24 February 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/1800
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
The Bipartite QUBO ⋮ Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem ⋮ Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP ⋮ Four-point conditions for the TSP: the complete complexity classification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- TSP heuristics: domination analysis and complexity
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
- Domination analysis of some heuristics for the traveling salesman problem
- The Quadratic Assignment Problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- An Efficient Heuristic Procedure for Partitioning Graphs
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- Construction heuristics for the asymmetric TSP.
