The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Aggregation of Inequalities in Integer Programming
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
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 Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
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
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Edmonds, J. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
Erdös, P. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_19 · Cited by 611
Cited by
Secret sharing scheme realizing general access structure
Ito, M., Saito, A., & Nishizeki, T. (1989) · Electronics and Communications in Japan (Part III: Fundamental Electronic Science) · doi:10.1002/ecjc.4430720906 · Cited by 681
Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization
Möhring, R. H., & Radermacher, F. J. (1984) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)72966-9 · Cited by 258
Metadata
- Authors
- Chvátal, V., & Hammer, P. L.
- Venue
- Annals of Discrete Mathematics
- Publisher
- Elsevier
- Published
- 1977
- Pages
- 145-162
- ISSN
- 0167-5060 (ISSN-L)
- OpenAlex
- W2314893179
- Cited by
- 448
- References
- 7
- FWCI
- 15.66
- Type
- book chapter
- 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: Aggregation of Inequalities in Integer Programming. https://app.cochat.ai/papers/10.1016/s0167-5060(08)70731-3
- The paper
- Chvátal, V., & Hammer, P. L. (1977). Aggregation of Inequalities in Integer Programming. Annals of Discrete Mathematics. https://doi.org/10.1016/s0167-5060(08)70731-3
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.