A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10479-015-1930-5 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-015-1930-5 / rank | |||
Normal rank | |||
Revision as of 15:13, 8 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic method for solving the problem of partitioning graphs with supply and demand |
scientific article |
Statements
A heuristic method for solving the problem of partitioning graphs with supply and demand (English)
0 references
9 March 2016
0 references
graph partitioning
0 references
greedy algorithm
0 references
demand node
0 references
supply node
0 references
