Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem (Q6043202): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/03155986.2005.11732724 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2408452789 / rank | |||
Normal rank | |||
Latest revision as of 08:50, 30 July 2024
scientific article; zbMATH DE number 7682442
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem |
scientific article; zbMATH DE number 7682442 |
Statements
Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem (English)
0 references
5 May 2023
0 references
heaviest \(k\)-subgraph problem
0 references
mixed integer linear programming
0 references
upper bounds
0 references
experiments
0 references
