Algorithms and hardness for non-pool-based line planning (Q6570897)
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 7879719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and hardness for non-pool-based line planning |
scientific article; zbMATH DE number 7879719 |
Statements
Algorithms and hardness for non-pool-based line planning (English)
0 references
10 July 2024
0 references
line planning
0 references
public transport
0 references
discrete optimization
0 references
complexity
0 references
algorithm design
0 references
0.8734049201011658
0 references
0.8004404902458191
0 references
0.7852848172187805
0 references
0.7852831482887268
0 references
