The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Logic‐Based Methods for Optimization: Combining Optimization and Constraint Satisfaction
Open accessAbstract
This tutorial describes a logic-based approach to formulating and solving pure and mixed integer programming problems. It develops logical counterparts for ideas associated with traditional branch-and-cut methods, such as cutting planes, facet-defining cuts, relaxations, etc. The motivations for doing this are a) to exploit the structure of a wide range of problems that are too complex for polyhedral analysis, b) to take advantage of logic processing techniques developed for constraint programming and logic programming, and c) to provide a unified approach to solving the growing number of problems with both qualitative and quantitative elements
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
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Constraint satisfaction in logic programming
Hentenryck, P. V. (1989) · Medical Entomology and Zoology · Cited by 1,218
Programming with Constraints: An Introduction
Marriott, K., & Stuckey, P. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/5625.001.0001 · Cited by 864
Stallman, R. M., & Sussman, G. J. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90029-7 · Cited by 712
Edmonds polytopes and a hierarchy of combinatorial problems
Chvátal, V. (1973) · Discrete Mathematics · doi:10.1016/0012-365x(73)90167-2 · Cited by 624
Partial constraint satisfaction
Freuder, E. C., & Wallace, R. J. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90004-h · Cited by 614
The Art of Prolog: Advanced Programming Techniques
STERLING, L. S., & Shapiro, E. Y. (1994) · Cited by 532
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
Cited by
Tight and compact MILP formulation for the thermal unit commitment problem
Morales-Espana, Latorre, J. M., & Ramos, A. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2251373 · Cited by 419
Metadata
- Authors
- Hooker, J.
- Venue
- Wiley eBooks
- Publisher
- Wiley
- Published
- 2000-05-16
- OpenAlex
- W1563600186
- Cited by
- 292
- References
- 13
- FWCI
- 1.12
- Type
- book
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Logic‐Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. https://app.cochat.ai/papers/10.1002/9781118033036
- The paper
- Hooker, J. (2000). Logic‐Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley eBooks. https://doi.org/10.1002/9781118033036
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.
