Efficient generation of performance bounds for a class of traffic scheduling problems (Q2286334)
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 7154932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient generation of performance bounds for a class of traffic scheduling problems |
scientific article; zbMATH DE number 7154932 |
Statements
Efficient generation of performance bounds for a class of traffic scheduling problems (English)
0 references
22 January 2020
0 references
guidepath-based traffic systems
0 references
traffic scheduling
0 references
Lagrangian duality
0 references
combinatorial optimization
0 references
0 references
0.7372339367866516
0 references
0.7372339367866516
0 references
0.7167201638221741
0 references
0.7119019627571106
0 references
0.7119019627571106
0 references
