A Lagrangian relaxation-based heuristic to solve large extended graph partitioning problems (Q2803836)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6576401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lagrangian relaxation-based heuristic to solve large extended graph partitioning problems |
scientific article; zbMATH DE number 6576401 |
Statements
A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems (English)
0 references
3 May 2016
0 references
0 references
0.829131007194519
0 references
0.7275809645652771
0 references
0.7214723229408264
0 references
0.7159942388534546
0 references
0.7124524116516113
0 references
