Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
| Year of publication: |
2011
|
|---|---|
| Authors: | Gouveia, Luis ; Paias, Ana ; Sharma, Dushyant |
| Published in: |
Journal of heuristics. - Norwell, Mass. [u.a.] : Springer Science + Business Media, ISSN 1381-1231, ZDB-ID 1333974-6. - Vol. 17.2011, 1, p. 23-37
|
| Subject: | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Dynamische Optimierung | Dynamic programming | Scheduling-Verfahren | Scheduling problem |
-
A two-level solution approach for solving the generalized minimum spanning tree problem
Pop, Petrică C., (2018)
-
Barros, Rafael Martins, (2025)
-
A primal adjacency-based algorithm for the shortest path problem with resource constraints
Himmich, Ilyas, (2020)
- More ...
-
Modeling and solving the rooted distance-constrained minimum spanning tree problem
Gouveia, Luis, (2008)
-
Gouveia, Luis, (2011)
-
Models for a traveling purchaser problem with additional side-constraints
Gouveia, Luis, (2011)
- More ...