On the complexity of the traveling umpire problem (Q476848): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Benders' cuts guided large neighborhood search for the traveling umpire problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition and local search based methods for the traveling umpire problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Improved Approximation Algorithm for the Traveling Tournament Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Latest revision as of 09:52, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the traveling umpire problem |
scientific article |
Statements
On the complexity of the traveling umpire problem (English)
0 references
2 December 2014
0 references
traveling umpire problem
0 references
computational complexity
0 references
sports scheduling
0 references
0 references
