The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Algorithms for the maximum satisfiability problem
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(1979) · Cited by 43,841
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
Approximation algorithms for combinatorial problems
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80044-9 · Cited by 2,197
Some simplified NP-complete graph problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90059-1 · Cited by 2,059
(1986) · Zeitschrift für wirtschaftlichen Fabrikbetrieb · doi:10.1515/zwf-1986-811227 · Cited by 1,932
The complexity of satisfiability problems
Schaefer, T. J. (1978) · Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 · doi:10.1145/800133.804350 · Cited by 1,737
Hayes-Roth, F. A., WATERMAN, D. A., & Lenat, D. B. (1983) · Andalas University Repository (Andalas University) · Cited by 1,702
On the Complexity of Timetable and Multicommodity Flow Problems
Even, S., Itai, A., & Shamir, A. (1976) · SIAM Journal on Computing · doi:10.1137/0205048 · Cited by 1,057
Linear-time algorithms for testing the satisfiability of propositional horn formulae
Dowling, W. F., & Gallier, J. H. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90014-1 · Cited by 1,013
A linear-time algorithm for testing the truth of certain quantified boolean formulas
Aspvall, B., Plass, M. F., & Tarjan, R. E. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90002-4 · Cited by 892
Logic and Databases: A Deductive Approach
Gallaire, H., Minker, J., & Nicolas, J.-M. (1984) · ACM Computing Surveys · doi:10.1145/356924.356929 · Cited by 733
Boolean Methods in Operations Research and Related Areas
Hammer, P. L., & Rudeanu, S. (1968) · Ökonometrie und Unternehmensforschung / Econometrics and Operations Research · doi:10.1007/978-3-642-85823-9 · Cited by 529
A simplified NP-complete satisfiability problem
Tovey, C. A. (1984) · Discrete Applied Mathematics · doi:10.1016/0166-218x(84)90081-7 · Cited by 382
A thermodynamically motivated simulation procedure for combinatorial optimization problems
Burkard, R. E., & Rendl, F. (1984) · European Journal of Operational Research · doi:10.1016/0377-2217(84)90231-5 · Cited by 345
Roof duality, complementation and persistency in quadratic 0–1 optimization
Hammer, P. L., Hansen, P., & Simeone, B. (1984) · Mathematical Programming · doi:10.1007/bf02612354 · Cited by 316
Self-citationComplete problems for deterministic polynomial time
Jones, N. D., & Laaser, W. T. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90068-2 · Cited by 279
Methods of Nonlinear 0-1 Programming
Hansen, P. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70343-1 · Cited by 220
Self-citationChecking an expert systems knowledge base for consistency and completeness
Nguyen, T. A., Perkins, W. A., Laffey, T. J., & Pecora, D. (1985) · International Joint Conference on Artificial Intelligence · Cited by 180
The tabu search metaheuristic: How we used it
Hertz, A., & de Werra, D. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531073 · Cited by 170
Simulated annealing methods with general acceptance probabilities
Anily, S., & Federgruen, A. (1987) · Journal of Applied Probability · doi:10.1017/s0021900200031387 · Cited by 146
Some results and experiments in programming techniques for propositional logic
Blair, C., Jeroslow, R. G., & Lowe, J. K. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90056-0 · Cited by 122
Complexity of Partial Satisfaction
Lieberherr, K. J., & Specker, E. P. (1981) · Journal of the ACM · doi:10.1145/322248.322260 · Cited by 70
(1977) · Lecture notes in computer science · doi:10.1007/3-540-08138-0 · Cited by 51
On the complexity of the maximum satisfiability problem for horn formulas
Jaumard, B., & Simeone, B. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90028-7 · Cited by 49
Self-citationPoljak, S., & Turzík, D. (1982) · Canadian Journal of Mathematics · doi:10.4153/cjm-1982-036-8 · Cited by 46
Integrity constraints in logic databases
Asirelli, P., Santis, M. D., & Martelli, M. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90020-2 · Cited by 44
Yamasaki, S., & Doshita, S. (1983) · Information and Control · doi:10.1016/s0019-9958(83)80027-8 · Cited by 30
Hansen, P., Jaumard, B., & Minoux, M. (1986) · Mathematical Programming · doi:10.1007/bf01580586 · Cited by 27
Self-citationYamasaki, S., & Doshita, S. (1986) · Information Processing Letters · doi:10.1016/0020-0190(86)90136-5 · Cited by 2
Cited by
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
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
An Introduction to Variable Neighborhood Search
Hansen, P., & Mladenović, N. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_30 · Cited by 340
Self-citationA systematic survey of computer-aided diagnosis in medicine: Past and present developments
Yanase, J., & Triantaphyllou, E. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112821 · Cited by 303
Babbush, R., Perdomo‐Ortiz, A., O'Gorman, B., Macready, W., & Aspuru‐Guzik, A. (2014) · Advances in Chemical Physics · doi:10.1002/9781118755815.ch05 · Cited by 45
Metadata
- Authors
- Hansen, P., & Jaumard, B.
- Venue
- Computing
- Published
- 1990-12
- Volume
- 44
- Issue
- 4
- Pages
- 279-303
- ISSN
- 0010-485X (ISSN-L)
- 1436-5057
- OpenAlex
- W1513769081
- Cited by
- 360
- References
- 37
- FWCI
- 10.50
- 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.
