Genetic algorithm approach on multi-criteria minimum spanning tree problem
From MaRDI portal
Publication:1809832
DOI10.1016/S0377-2217(98)00016-2zbMath0945.90009OpenAlexW2077823485WikidataQ126352136 ScholiaQ126352136MaRDI QIDQ1809832
Publication date: 11 October 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00016-2
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)
Related Items (38)
A multi-agent transgenetic algorithm for the bi-objective spanning tree problem ⋮ Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems ⋮ A global optimization algorithm for target set selection problems ⋮ Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example ⋮ C-semiring Frameworks for Minimum Spanning Tree Problems ⋮ A new approach for the multiobjective minimum spanning tree ⋮ Minimum spanning trees made easier via multi-objective optimization ⋮ On the bicriterion - minimal cost/minimal label - spanning tree problem ⋮ Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem ⋮ 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 ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Biobjective optimization problems on matroids with binary costs ⋮ The minimum spanning tree problem with conflict constraints and its variations ⋮ Design of a multiobjective reverse logistics network considering the cost and service level ⋮ A class of rough multiple objective programming and its application to solid transportation problem ⋮ The multi-criteria minimum spanning tree problem based genetic algorithm ⋮ Quadratic bottleneck problems ⋮ Modeling and solving the bi-objective minimum diameter-cost spanning tree problem ⋮ An analysis on recombination in multi-objective evolutionary optimization ⋮ A GRASP algorithm for the multi-criteria minimum spanning tree problem ⋮ A survey of recent developments in multiobjective optimization ⋮ Relations, models and a memetic approach for three degree-dependent spanning tree problems ⋮ 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 ⋮ Dynamic programming for spanning tree problems: application to the multi-objective case ⋮ Finding multi-objective supported efficient spanning trees ⋮ The cable trench problem: Combining the shortest path and minimum spanning tree problems ⋮ Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs ⋮ Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm ⋮ 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 ⋮ Fuzzy α-minimum spanning tree problem: definition and solutions ⋮ A genetic-based framework for solving (multi-criteria) weighted matching problems. ⋮ Optimality conditions in preference-based spanning tree problems ⋮ An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem ⋮ Genetic algorithms in logic tree decision modeling ⋮ Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- Stochastic spanning tree problem
- An effective genetic algorithm approach to the quadratic minimum spanning tree problem
- The probabilistic minimum spanning tree problem
- A note on genetic algorithms for degree-constrained spanning tree problems
This page was built for publication: Genetic algorithm approach on multi-criteria minimum spanning tree problem
