The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“In line 4 of algorithm 1, finding the best layout A given W and B A,X is an instance of the maximum edge-weighted clique problem, which is NP-Hard [15].”
From An Efficient Bandit Algorithm for Realtime Multivariate Optimization (2017) · cites this paper as [15]
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
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,778
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_8 · Cited by 2,310
Deza, M. M., & Laurent, M. (1997) · Algorithms and combinatorics · doi:10.1007/978-3-642-04295-9 · Cited by 1,014
The boolean quadric polytope: Some characteristics, facets and relatives
Padberg, M. W. (1989) · Mathematical Programming · doi:10.1007/bf01589101 · Cited by 356
Johnson, E. L., Mehrotra, A., & Nemhauser, G. L. (1993) · Mathematical Programming · doi:10.1007/bf01585164 · Cited by 225
An extended formulation approach to the edge-weighted maximal clique problem
Park, K., Lee, K., & Park, S. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00299-5 · Cited by 66
An adaptive simulated annealing algorithm for global optimization over continuous variables
Jones, A. E. W., & Forbes, G. W. (1995) · Journal of Global Optimization · doi:10.1007/bf01106604 · Cited by 59
A cutting-plane approach to the edge-weighted maximal clique problem
van Dijkhuizen, G. C., & Faigle, U. (1993) · European Journal of Operational Research · doi:10.1016/0377-2217(93)90097-7 · Cited by 44
Research works printed but not linked: 2
- C.C. de Souza, The graph equipartition problem: Optimal solutions, extensions and applications, Ph.D. thesis, Université Catholique de Louvain, Faculté des Sciences Appliqués, Unité de Gestion Industrielle, Louvain-La-Neuve, Belgique, November 1993
- Hunting, M.M.G., Relaxations techniques for discrete optimization problems, Ph.D. thesis, University Twente, Enschede, Netherlands, 1998
Cited by
An Efficient Bandit Algorithm for Realtime Multivariate Optimization
Hill, D. N., Nassif, H., Liu, Y., Iyer, A., & Vishwanathan, S. V. N. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098184 · Cited by 113
Metadata
- Authors
- Macambira, E. M., & de Souza, C. C.
- Affiliations
- Universidade Estadual do Ceará (BR)
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2000-06
- Volume
- 123
- Issue
- 2
- Pages
- 346-371
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2026591719
- Semantic Scholar
- 5d26cf8c10483b94c984a7ceb811ee5abd291e55
- Cited by
- 55
- References
- 13
- Citations by year
- 2026: 1 · 2025: 2 · 2023: 1 · 2022: 1 · 2021: 3 · 2020: 5 · 2019: 3 · 2018: 2 · 2017: 4 · 2016: 4 · 2015: 1 · 2014: 4 · 2013: 5 · 2012: 1
- FWCI
- 0.90
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Locations
- European Journal of Operational Research (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Keywords
- valid inequalities, facet-defining inequalities, facial structure, polyhedral analysis, branch-and-cut, NP-hard combinatorial optimization
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: The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations. https://app.cochat.ai/papers/10.1016/s0377-2217(99)00262-3
- The paper
- Macambira, E. M., & de Souza, C. C. (2000). The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations. European Journal of Operational Research. https://doi.org/10.1016/s0377-2217(99)00262-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.