The pairwise flowtime network construction problem
Year of publication: |
2021
|
---|---|
Authors: | Averbakh, Igor |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 6, p. 902-907
|
Subject: | Connectivity restoration | Flowtime scheduling | Network construction planning | Polynomial algorithm | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Bauwirtschaft | Construction industry | Theorie | Theory | Netzwerk | Network | Unternehmensnetzwerk | Business network |
-
Network construction problems with due dates
Averbakh, Igor, (2015)
-
Incremental network design with maximum flows
Kalinowski, Thomas, (2015)
-
Modeling and solving the multi-period disruptions scheduling problem on urban networks
Coco, Amadeu A., (2020)
- More ...
-
Network construction problems with due dates
Averbakh, Igor, (2015)
-
The minmax regret permutation flow-shop problem with two jobs
Averbakh, Igor, (2006)
-
On the complexity of minmax regret linear programming
Averbakh, Igor, (2005)
- More ...