Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (Q326488)
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: Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period |
scientific article |
Statements
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (English)
0 references
12 October 2016
0 references
network models
0 references
complexity theory
0 references
maintenance scheduling
0 references
mixed integer programming
0 references
0 references
0 references
0.9431767463684082
0 references
0.8966405987739563
0 references
0.8740383982658386
0 references
0.7937184572219849
0 references
0.789350152015686
0 references
