CoChat

The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations

Macambira, Elder Magalhães, de Souza, Cid Carvalho · 2000 · European Journal of Operational Research

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

Crossref · 10.1016/s0377-2217(99)00262-3

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 13 references

Research works printed but not linked: 2

  1. 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
  2. Hunting, M.M.G., Relaxations techniques for discrete optimization problems, Ph.D. thesis, University Twente, Enschede, Netherlands, 1998

Cited by

See all 55

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
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.