A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem
Year of publication: |
2023
|
---|---|
Authors: | Dell'Amico, Mauro ; Jamal, Jafar ; Montemanni, Roberto |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 156.2023, p. 1-9
|
Subject: | Branch and bound | Lagrangian relaxation | Mixed integer linear programming | Network optimization | Precedence constrained arborescences | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
Detienne, Boris, (2016)
-
Gendron, Bernard, (2016)
-
A branch-and-price algorithm for the multiple knapsack problem
Lalonde, Olivier, (2022)
- More ...
-
Precedence-constrained arborescences
Chou, Xiaochen, (2023)
-
Exact models for the flying sidekick traveling salesman problem
Dell'Amico, Mauro, (2021)
-
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
Dell'Amico, Mauro, (2020)
- More ...