Minimum cost flow problem with conflicts (Q6065835)
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 7775488
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost flow problem with conflicts |
scientific article; zbMATH DE number 7775488 |
Statements
Minimum cost flow problem with conflicts (English)
0 references
11 December 2023
0 references
branch-and-bound
0 references
combinatorial optimization
0 references
conflict constraints
0 references
minimum cost flow
0 references
networks
0 references
Russian doll search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8751313090324402
0 references
0.7946680784225464
0 references
0.7788288593292236
0 references
0.7665812969207764
0 references
0.7658103108406067
0 references
