New heuristic approaches for the bounded-diameter minimum spanning tree problem
Year of publication: |
2015
|
---|---|
Authors: | Steitz, Wolfgang |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 27.2015, 1, p. 151-163
|
Subject: | backbone | bounded-diameter minimum spanning tree problem | construction heuristics | diameter | optimization | spanning trees | Heuristik | Heuristics | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem |
-
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
Ruiz, Efrain, (2015)
-
Constrained min-cut replication for K-way hypergraph partitioning
Yazici, Volkan, (2014)
-
A graph coloring approach to the deployment scheduling and unit assignment problem
Zais, Mark, (2016)
- More ...
-
Using Penalties instead of Rewards: Solving OCST Problems with Problem-Specic Guided Local Search
Steitz, Wolfgang, (2011)
-
Edge Orientation and the Design of problem-specic EAs forthe OCST problem
Steitz, Wolfgang, (2009)
-
Moving-Window Rubik's Cube SolverGecco Competition 2009
Steitz, Wolfgang, (2009)
- More ...