Genetic algorithm approach on multi-criteria minimum spanning tree problem
From MaRDI portal
Publication:1809832
Recommendations
- The multi-criteria minimum spanning tree problem based genetic algorithm
- An effective genetic algorithm approach to the quadratic minimum spanning tree problem
- Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
- Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems
- A solution of real-world OCST problems with a new tree encoding-based genetic algorithm
Cites work
- A note on genetic algorithms for degree-constrained spanning tree problems
- A note on two problems in connexion with graphs
- An effective genetic algorithm approach to the quadratic minimum spanning tree problem
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 702365 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Stochastic spanning tree problem
- The probabilistic minimum spanning tree problem
Cited in
(46)- Optimality conditions in preference-based spanning tree problems
- An effective genetic algorithm approach to the quadratic minimum spanning tree problem
- A new approach for the multiobjective minimum spanning tree
- An improved genetic algorithm for the large-scale rural highway network layout
- A genetic-based framework for solving (multi-criteria) weighted matching problems.
- Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
- Design of a multiobjective reverse logistics network considering the cost and service level
- Dynamic programming for spanning tree problems: application to the multi-objective case
- Finding multi-objective supported efficient spanning trees
- Kruskal with embedded c-semirings to solve MST problems with partially-ordered costs
- A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
- A genetic algorithm for minimum conflict weighted spanning tree problem
- Relations, models and a memetic approach for three degree-dependent spanning tree problems
- Multi-objective optimization for a closed-loop network design problem using an improved genetic algorithm
- Empirical study of exact algorithms for the multi-objective spanning tree
- Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
- The multi-criteria minimum spanning tree problem based genetic algorithm
- A survey of recent developments in multiobjective optimization
- Genetic algorithms in logic tree decision modeling
- A global optimization algorithm for target set selection problems
- On the bicriterion - minimal cost/minimal label - spanning tree problem
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- Fuzzy -minimum spanning tree problem: definition and solutions
- A solution of real-world OCST problems with a new tree encoding-based genetic algorithm
- C-semiring Frameworks for Minimum Spanning Tree Problems
- Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm
- The minimum spanning tree problem with conflict constraints and its variations
- A class of rough multiple objective programming and its application to solid transportation problem
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
- An analysis on recombination in multi-objective evolutionary optimization
- An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
- scientific article; zbMATH DE number 5269238 (Why is no real title available?)
- Quadratic bottleneck problems
- scientific article; zbMATH DE number 5204030 (Why is no real title available?)
- scientific article; zbMATH DE number 2214470 (Why is no real title available?)
- The cable trench problem: Combining the shortest path and minimum spanning tree problems
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- Biobjective optimization problems on matroids with binary costs
- Dynamic and static simulated annealing for solving the multi-objective k-minimum spanning tree problem
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- A preference-based approach to spanning trees and shortest paths problems
- Minimum spanning trees made easier via multi-objective optimization
- 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
- A GRASP algorithm for the multi-criteria minimum spanning tree problem
This page was built for publication: Genetic algorithm approach on 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 Q1809832)
