The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 07:43, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations |
scientific article |
Statements
The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (English)
0 references
7 June 2001
0 references
edge-weighted cliques
0 references
polyhedral combinatorics
0 references
integer programming
0 references
branch-and-cut
0 references
Boolean quadric polytope
0 references
