The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Adaptive Memory Tabu Search for Binary Quadratic Programs
Abstract
Recent studies have demonstrated the effectiveness of applying adaptive memory tabu search procedures to combinatorial optimization problems. In this paper we describe the development and use of such an approach to solve binary quadratic programs. Computational experience is reported, showing that the approach optimally solves the most difficult problems reported in the literature. For challenging problems of limited size, which are capable of being approached by exact procedures, we find optimal solutions considerably faster than the best reported exact method. Moreover, we demonstrate that our approach is significantly more efficient and yields better solutions than the best heuristic method reported to date. Finally, we give outcomes for larger problems that are considerably more challenging than any currently reported in the literature.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Self-citation
Cited by
The unconstrained binary quadratic programming problem: a survey
Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., Lü, Z., Wang, H., & Wang, Y. (2014) · Journal of Combinatorial Optimization · doi:10.1007/s10878-014-9734-0 · Cited by 473
Self-citationThe Hyper-Cube Framework for Ant Colony Optimization
Blum, C., & Dorigo, M. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2003.821450 · Cited by 432
Glover, F., & Laguna, M. (1998) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4613-0303-9_33 · Cited by 428
Self-citationQuantum bridge analytics I: a tutorial on formulating and using QUBO models
Glover, F., Kochenberger, G., Hennig, R., & Du, Y. (2022) · Annals of Operations Research · doi:10.1007/s10479-022-04634-2 · Cited by 297
Self-citationSolving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Rendl, F., Rinaldi, G., & Wiegele, A. (2010) · Mathematical Programming · doi:10.1007/s10107-008-0235-8 · Cited by 264
Metadata
- Authors
- Glover, F., Kochenberger, G. A., & Alidaee, B.
- Venue
- Management Science
- Published
- 1998-03
- Volume
- 44
- Issue
- 3
- Pages
- 336-345
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2115910554
- Cited by
- 209
- References
- 1
- FWCI
- 4.38
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.