Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective (Q2028839)
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 7354065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective |
scientific article; zbMATH DE number 7354065 |
Statements
Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective (English)
0 references
3 June 2021
0 references
combinatorial optimization
0 references
inland waterway
0 references
serial-lock scheduling
0 references
multi-commodity network
0 references
mixed integer linear programming
0 references
0 references
0 references
0 references
0 references
0.8471450805664062
0 references
0.7680375576019287
0 references
0.7504528760910034
0 references
0.7199218273162842
0 references
0.7147544026374817
0 references
