The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622)
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 7769688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> |
scientific article; zbMATH DE number 7769688 |
Statements
The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (English)
0 references
23 November 2023
0 references
branch-and-cut
0 references
combinatorial optimization
0 references
extended formulation
0 references
graph partitioning
0 references
integer programming
0 references
polyhedral approach
0 references
0 references
