Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem
Year of publication: |
16 November 2018
|
---|---|
Authors: | Chagas, Rosklin Juliano ; Valle, Cristiano Arbex ; Cunha, Alexandre Salles da |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 271.2018, 1 (16.11.), p. 57-71
|
Subject: | Combinatorial optimization | Lagrangian relaxation | Branch and cut | Multi-period spanning trees | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
GuimarĂ£es, Dilson Almeida, (2020)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
An effective branch-and-bound algorithm for the maximum s-bundle problem
Zhou, Yi, (2022)
- More ...
-
Optimally solving the joint order batching and picker routing problem
Valle, Cristiano Arbex, (2017)
-
Valle, Cristiano Arbex, (2014)
-
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Valle, Cristiano Arbex, (2011)
- More ...