Lateness minimization in pairwise connectivity restoration problems
| Year of publication: |
2018
|
|---|---|
| Authors: | Averbakh, Igor ; Pereira, Jordi |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 30.2018, 3, p. 522-538
|
| Subject: | combinatorial optimization | networks: scheduling | programming | branch and bound | network restoration | network construction | integrated network design and scheduling | Scheduling-Verfahren | Scheduling problem | Netzwerk | Network | Unternehmensnetzwerk | Business network | Mathematische Optimierung | Mathematical programming | Lieferkette | Supply chain | Branch-and-Bound | Branch and Bound | Tourenplanung | Vehicle routing problem | Graphentheorie | Graph theory | Soziales Netzwerk | Social network |
-
Network construction problems with due dates
Averbakh, Igor, (2015)
-
Pamuk, Bahadır, (2025)
-
On the maximum small-world subgraph problem
Kim, Jongeun, (2020)
- More ...
-
Tree optimization based heuristics and metaheuristics in network construction problems
Averbakh, Igor, (2021)
-
Network construction problems with due dates
Averbakh, Igor, (2015)
-
Exact and heuristic algorithms for the interval data robust assignment problem
Pereira, Jordi, (2011)
- More ...