A minimax scheduling problem (Q1133461)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A minimax scheduling problem |
scientific article; zbMATH DE number 3655672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A minimax scheduling problem |
scientific article; zbMATH DE number 3655672 |
Statements
A minimax scheduling problem (English)
0 references
1978
0 references
minimax scheduling
0 references
branch and bound
0 references
linear bottleneck travelling salesman problem
0 references
computational experience
0 references
