A new dynamic programming approach for spanning trees with chain constraints and beyond
Year of publication: |
2024
|
---|---|
Authors: | Nägele, Martin ; Zenklusen, Rico |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 49.2024, 4, p. 2078-2108
|
Subject: | dynamic programming | combinatorial optimization | constrained minimum spanning tree | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung | Dynamic programming | Graphentheorie | Graph theory |
-
Optimization problems in graphs with locational uncertainty
Bougeret, Marin, (2023)
-
A two-level solution approach for solving the generalized minimum spanning tree problem
Pop, Petrică C., (2018)
-
A primal adjacency-based algorithm for the shortest path problem with resource constraints
Himmich, Ilyas, (2020)
- More ...
-
Refuting a conjecture of Goemans on bounded degree spanning trees
Chestnut, Stephen, (2016)
-
Congruency-constrained TU problems beyond the bimodular case
Nägele, Martin, (2024)
-
Approximate dynamic programming for stochastic linear control problems on compact state spaces
Woerner, Stefan, (2015)
- More ...