The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut (Q1728091)
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: The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut |
scientific article; zbMATH DE number 7027410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut |
scientific article; zbMATH DE number 7027410 |
Statements
The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut (English)
0 references
21 February 2019
0 references
vertex separator problem
0 references
integer programming
0 references
polytope
0 references
facet
0 references
branch-and-cut algorithm
0 references
complexity
0 references
separation algorithm
0 references
0.9228203296661376
0 references
0.8696261644363403
0 references
0.8594406843185425
0 references
0.8417706489562988
0 references
0.8183841705322266
0 references
