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 | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Theorie | Theory |
-
A column generation-based approach for proportionate flexible two-stage no-wait job shop scheduling
Pei, Zhi, (2020)
-
Minimising the makespan in the two-machine job shop problem under availability constraints
Benttaleb, Mourad, (2019)
-
Minimizing makespan on a single machine with release dates and inventory constraints
Davari, Morteza, (2020)
- More ...
-
Precedence-constrained arborescences
Chou, Xiaochen, (2023)
-
Exact models for the flying sidekick traveling salesman problem
Dell'Amico, Mauro, (2021)
-
The Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones
Montemanni, Roberto, (2023)
- More ...