A branch-and-cut algorithm for the equicut problem (Q1373750)
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 1091312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the equicut problem |
scientific article; zbMATH DE number 1091312 |
Statements
A branch-and-cut algorithm for the equicut problem (English)
0 references
1997
0 references
heuristic algorithm
0 references
equicut problem
0 references
complete graphs
0 references
cutting-plane procedure
0 references
branch-and-cut
0 references
0 references
0 references
0.94709915
0 references
0.90907985
0 references
0.90825415
0 references
0.8975651
0 references
0.8924197
0 references
0.8912727
0 references
0.8902544
0 references
0.88353074
0 references
