Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut (Q2299979)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut |
scientific article |
Statements
Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut (English)
0 references
24 February 2020
0 references
matching interdiction/blocker problem
0 references
bipartite graph
0 references
polytope
0 references
integer linear programming
0 references
branch-and-cut
0 references
0 references
0 references
0 references
