Solving the minimum labeling global cut problem by mathematical programming (Q6889526)
From MaRDI portal
!
WARNING
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 8131720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the minimum labeling global cut problem by mathematical programming |
scientific article; zbMATH DE number 8131720 |
Statements
Solving the minimum labeling global cut problem by mathematical programming (English)
0 references
4 December 2025
0 references
edge-labeled graphs
0 references
integer programming
0 references
branch-and-cut
0 references
polyhedral study
0 references
