A GRASP algorithm for the multi-criteria minimum spanning tree problem
From MaRDI portal
Publication:940883
Recommendations
- An improved algorithm to solve the multi-criteria minimum spanning tree problem
- A new approach for the multiobjective minimum spanning tree
- On spanning tree problems with multiple objectives
- A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
- The multi-criteria minimum spanning tree problem based genetic algorithm
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- A partial enumeration heuristic for multi-objective flowshop scheduling problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An annotated bibliography of GRASP – Part I: Algorithms
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- Greedy randomized adaptive search procedures
- Introduction to algorithms
- Multi-objective meta-heuristics: An overview of the current state-of-the-art
- On spanning tree problems with multiple objectives
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimization by simulated annealing
- The problem of the optimal biobjective spanning tree
Cited in
(20)- Dynamic and static simulated annealing for solving the multi-objective k-minimum spanning tree problem
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- Multi-objective matroid optimization with ordinal weights
- Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations
- Combinatorial optimization in system configuration design
- On solving bi-objective constrained minimum spanning tree problems
- A multi-objective GRASP procedure for reactive power compensation planning
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
- Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
- Kruskal with embedded c-semirings to solve MST problems with partially-ordered costs
- Assessing the benefits of storage and transshipments yards in timber supply chains by a column generation + GRASP approach
- Empirical study of exact algorithms for the multi-objective spanning tree
- A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
- An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
- The multi-criteria minimum spanning tree problem based genetic algorithm
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
- A nonmonotone GRASP
- Multiobjective GRASP with path relinking
- An improved algorithm to solve the multi-criteria minimum spanning tree problem
This page was built for publication: A GRASP algorithm for the multi-criteria minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q940883)
