A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
From MaRDI portal
Recommendations
- Savings based ant colony optimization for the capacitated minimum spanning tree problem
- An efficient branch and bound algorithm for the CMST problem
- scientific article; zbMATH DE number 2090612
- Heuristics for the multi-level capacitated minimum spanning tree problem
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
Cites work
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
- A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem
- A New Class of Algorithms for Multipoint Network Optimization
- A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
- Dynamic programming based heuristics for the topological design of local access networks
- Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
- Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Heuristic search to the capacitated clustering problem
- scientific article; zbMATH DE number 5829047 (Why is no real title available?)
- scientific article; zbMATH DE number 1420487 (Why is no real title available?)
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
- Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
- On the shortest spanning subtree of a graph and the traveling salesman problem
- RAMP for the capacitated minimum spanning tree problem
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Savings based ant colony optimization for the capacitated minimum spanning tree problem
- The Capacitated Minimum Spanning Tree
- The capacitated minimum spanning tree problem: On improved multistar constraints
- The complexity of the capacitated tree problem
- Topological design of centralized computer networks—formulations and algorithms
- Topological design of telecommunication networks --- local access design methods
Cited in
(9)- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
- Savings based ant colony optimization for the capacitated minimum spanning tree problem
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
- An efficient branch and bound algorithm for the CMST problem
- An effective hybrid evolutionary algorithm for the clustered orienteering problem
- Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
- Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
This page was built for publication: A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147081)
