Evolving instances of unconstrained binary quadratic programming that challenge a tabu search heuristic
Abstract
References
Index Terms
- Evolving instances of unconstrained binary quadratic programming that challenge a tabu search heuristic
Recommendations
A tabu search algorithm for the quadratic assignment problem
Tabu search approach based algorithms are among the widest applied to various combinatorial optimization problems. In this paper, we propose a new version of the tabu search algorithm for the well-known problem, the quadratic assignment problem (QAP). ...
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
In this paper, a greedy heuristic and two local search algorithms, 1-opt local search and k-opt local search, are proposed for the unconstrained binary quadratic programming problem (BQP). These heuristics are well suited for the incorporation into meta-...
Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
The quadratic multiple knapsack problem (QMKP) concerns assigning a set of objects, which interact among themselves through paired profit values, to a set of capacity-constrained knapsacks such that the overall profit of the objects included in the ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/879a9e4a-fbb4-4a9e-8b3d-244fa1ba1878/2330784.cover.jpg)
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Abstract
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 65Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in