The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
An Economics Approach to Hard Computational Problems
Abstract
A general method for combining existing algorithms into new programs that are unequivocally preferable to any of the component algorithms is presented. This method, based on notions of risk in economics, offers a computational portfolio design procedure that can be used for a wide range of problems. Tested by solving a canonical NP-complete problem, the method can be used for problems ranging from the combinatorics of DNA sequencing to the completion of tasks in environments with resource contention, such as the World Wide Web.
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
(1979) · Cited by 43,841
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications
Mezard, M., Parisi, G., & Virasoro, M. (1986) · World Scientific Lecture Notes in Physics · doi:10.1142/0271 · Cited by 3,653
Introduction to Plasma Physics and Controlled Fusion
Chen, F. F. (1984) · Springer eBooks · doi:10.1007/978-1-4757-5595-4 · Cited by 3,279
Mezard, M., Parisi, G., Virasoro, M. A., & Thouless, D. J. (1988) · Physics Today · doi:10.1063/1.2811676 · Cited by 2,682
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
(2024) · doi:10.1145/3618260 · Cited by 1,730
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989) · Operations Research · doi:10.1287/opre.37.6.865 · Cited by 1,457
Portfolio theory and capital markets
Breen, W. J., & Sharpe, W. F. (1972) · The Journal of Finance · doi:10.2307/2978700 · Cited by 1,221
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991) · Operations Research · doi:10.1287/opre.39.3.378 · Cited by 845
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90007-k · Cited by 843
Cited by
Improving the search performance of SHADE using linear population size reduction
Tanabe, R., & Fukunaga, A. S. (2014) · 2014 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2014.6900380 · Cited by 1,625
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
Methods for task allocation via agent coalition formation
Shehory, O., & Kraus, S. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00045-9 · Cited by 1,080
SATzilla: Portfolio-based Algorithm Selection for SAT
Xu, L., Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2490 · Cited by 857
Metadata
- Authors
- Huberman, B. A., Lukose, R. M., & Hogg, T.
- Venue
- Science
- Published
- 1997-01-03
- Volume
- 275
- Issue
- 5296
- Pages
- 51-54
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2064902266
- Cited by
- 390
- References
- 16
- FWCI
- 20.25
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Economics Approach to Hard Computational Problems. https://app.cochat.ai/papers/10.1126/science.275.5296.51
- The paper
- Huberman, B. A., Lukose, R. M., & Hogg, T. (1997). An Economics Approach to Hard Computational Problems. Science. https://doi.org/10.1126/science.275.5296.51
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.