Cited By
View all- Wu HWang CLu CZhan T(2024)HCT: a hybrid CNN and transformer network for hyperspectral image super-resolutionMultimedia Systems10.1007/s00530-024-01387-930:4Online publication date: 20-Jun-2024
The intrinsic difficulty of the Traveling Salesman Problem (TSP) is associated with the combinatorial explosion of potential solutions in the solution space. The significant difficulty with search algorithms for the TSP is how to quickly find the optimal ...
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and drop moves, each of which can be interpreted as 1-opt move, to search a k-...
Local search algorithms for combinatorial optimization problems are generally of pseudopolynomial running time, and polynomial-time algorithms are not often known for finding locally optimal solutions for NP-hard optimization problems. We introduce the ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in