Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm (Q342392)
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 6654179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm |
scientific article; zbMATH DE number 6654179 |
Statements
Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm (English)
0 references
17 November 2016
0 references
sports scheduling
0 references
traveling umpire problem
0 references
integer programming
0 references
branch-and-cut
0 references
OR in sports
0 references
0 references
0 references
0.9139374494552612
0 references
0.8981860876083374
0 references
0.8770172595977783
0 references
0.8406336307525635
0 references
0.8336637616157532
0 references
