Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem (Q4950824)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem |
scientific article; zbMATH DE number 1437239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem |
scientific article; zbMATH DE number 1437239 |
Statements
Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem (English)
0 references
27 April 2000
0 references
graph partitioning problems
0 references
Lagrangian relaxation
0 references
mixed integer programming
0 references
0.7539530992507935
0 references
0.7444196939468384
0 references
0.7380061745643616
0 references
0.723179280757904
0 references
