A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems (Q6068539)
From MaRDI portal
scientific article; zbMATH DE number 7764308
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems |
scientific article; zbMATH DE number 7764308 |
Statements
A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems (English)
0 references
13 November 2023
0 references
bipartite graphs
0 references
branch-and-cut algorithm
0 references
integer programming
0 references
symmetry
0 references
telecommunications
0 references
valid inequalities
0 references
