The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Logic-based Benders decomposition
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
Foundations of Constraint Satisfaction
(1993) · Elsevier eBooks · doi:10.1016/c2013-0-07627-x · Cited by 1,629
The Problem of Simplifying Truth Functions
Quine, W. V. (1952) · The American Mathematical Monthly · doi:10.1080/00029890.1952.11988183 · Cited by 894
A Way to Simplify Truth Functions
Quine, W. V. (1955) · The American Mathematical Monthly · doi:10.1080/00029890.1955.11988710 · Cited by 633
Testing heuristics: We have it all wrong
Hooker, J. N. (1995) · Journal of Heuristics · doi:10.1007/bf02430364 · Cited by 437
Self-citationAlgorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
Jain, V., & Grossmann, I. E. (2001) · INFORMS Journal on Computing · doi:10.1287/ijoc.13.4.258.9733 · Cited by 400
Logic-based methods for optimization: combining optimization and constraint satisfaction
(2001) · Choice Reviews Online · doi:10.5860/choice.38-3939 · Cited by 304
Logic‐Based Methods for Optimization: Combining Optimization and Constraint Satisfaction
Hooker, J. (2000) · Wiley eBooks · doi:10.1002/9781118033036 · Cited by 292
Self-citationA Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Automation of Reasoning · doi:10.1007/978-3-642-81952-0_26 · Cited by 234
Needed: An Empirical Science of Algorithms
Hooker, J. N. (1994) · Operations Research · doi:10.1287/opre.42.2.201 · Cited by 213
Self-citationResolution vs. cutting plane solution of inference problems: Some computational experience
Hooker, J. (1988) · Operations Research Letters · doi:10.1016/0167-6377(88)90044-2 · Cited by 83
Self-citationBranch-and-cut solution of inference problems in propositional logic
Hooker, J., & Fedjki, C. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531074 · Cited by 73
Self-citationGeneralized resolution for 0?1 linear inequalities
Hooker, J. N. (1992) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531033 · Cited by 60
Self-citationRecognizing disguised NR(1) instances of the satisfiability problem
Aspvall, B. (1980) · Journal of Algorithms · doi:10.1016/0196-6774(80)90007-3 · Cited by 58
On renamable Horn and generalized Horn functions
Chandru, V., Coullard, C. R., Hammer, P. L., Montañez, M., & Sun, X. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531069 · Cited by 36
Duality in mathematics and linear and integer programming
Williams, H. P. (1996) · Journal of Optimization Theory and Applications · doi:10.1007/bf02189998 · Cited by 35
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Dynamic Task Offloading and Scheduling for Low-Latency IoT Services in Multi-Access Edge Computing
Alameddine, H. A., Sharafeddine, S., Sebbah, S., Ayoubi, S., & Assi, C. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2894306 · Cited by 364
Vasconcelos, M., Cardonha, C., & Gonçalves, B. (2018) · Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society · doi:10.1145/3278721.3278751 · Cited by 38
Metadata
- Authors
- Hooker, J. N., & Ottosson, G.
- Venue
- Mathematical Programming
- Published
- 2003-04
- Volume
- 96
- Issue
- 1
- Pages
- 33-60
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W1508945008
- Cited by
- 595
- References
- 18
- FWCI
- 17.10
- Type
- journal article
- Language
- en
- Open access
- green
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.