Branch-and-cut algorithms for the p-arborescence star problem
Year of publication: |
2022
|
---|---|
Authors: | Pereira, Armando Honorio ; Mateus, Geraldo R. ; Urrutia, Sebastián |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 29.2022, 4, p. 2374-2400
|
Subject: | arborescence | branch and cut | integer programming | wireless sensor networks | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Computernetz | Computer network | Branch-and-Bound | Branch and Bound | Operations Research | Operations research |
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
A branch and cut algorithm for the hierarchical network design problem
Obreque, Carlos, (2010)
-
A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
Karaoglan, Ismail, (2011)
- More ...
-
Pereira, Armando Honorio, (2022)
-
Branch‐and‐cut algorithms for the ‐arborescence star problem
Pereira, Armando Honorio, (2020)
-
Stochastic capacity planning and dynamic network design
Pimentel, Bruno S., (2013)
- More ...