Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms
Year of publication: |
2020
|
---|---|
Authors: | Requejo, Cristina ; Santos, Eulália |
Subject: | Weighted minimum spanning tree | Minimum spanning tree | Lagrangian based algorithms | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Population-based iterated greedy algorithm for the S-labeling problem
Lozano, Manuel, (2023)
-
Extended formulations for perfect domination problems and their algorithmic implications
Forte, Vinícius Leal do, (2023)
- More ...
-
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
Gouveia, Luis, (2001)
-
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
Gouveia, Luis, (2001)
-
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
Gouveia, Luis, (2006)
- More ...