A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem (Q5279220): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2298/pim1613099m / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2346195346 / rank | |||
Normal rank | |||
Latest revision as of 10:48, 30 July 2024
scientific article; zbMATH DE number 6749613
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem |
scientific article; zbMATH DE number 6749613 |
Statements
A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem (English)
0 references
19 July 2017
0 references
integer linear programming
0 references
degree-constrained subgraph
0 references
combinatorial optimization
0 references
