Pages that link to "Item:Q1809832"

The following pages link to Genetic algorithm approach on multi-criteria minimum spanning tree problem (Q1809832):

Displaying 37 items.

• The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
• A class of rough multiple objective programming and its application to solid transportation problem (Q454949) (← links)
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
• An analysis on recombination in multi-objective evolutionary optimization (Q490439) (← links)
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
• A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
• Minimum spanning trees made easier via multi-objective optimization (Q862963) (← links)
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem (Q877664) (← links)
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem (Q884444) (← links)
• A GRASP algorithm for the multi-criteria minimum spanning tree problem (Q940883) (← links)
• Optimality conditions in preference-based spanning tree problems (Q1027614) (← links)
• A new approach for the multiobjective minimum spanning tree (Q1651644) (← links)
• A genetic-based framework for solving (multi-criteria) weighted matching problems. (Q1811148) (← links)
• Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm (Q1848402) (← links)
• Design of a multiobjective reverse logistics network considering the cost and service level (Q1955359) (← links)
• Dynamic programming for spanning tree problems: application to the multi-objective case (Q2018859) (← links)
• Finding multi-objective supported efficient spanning trees (Q2028494) (← links)
• Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs (Q2032145) (← links)
• A multi-agent transgenetic algorithm for the bi-objective spanning tree problem (Q2132380) (← links)
• Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
• Multi-objective optimization for a closed-loop network design problem using an improved genetic algorithm (Q2290090) (← links)
• Empirical study of exact algorithms for the multi-objective spanning tree (Q2301151) (← links)
• Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems (Q2371985) (← links)
• Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example (Q2379867) (← links)
• The multi-criteria minimum spanning tree problem based genetic algorithm (Q2456475) (← links)
• A survey of recent developments in multiobjective optimization (Q2468335) (← links)
• Genetic algorithms in logic tree decision modeling (Q2572259) (← links)
• A global optimization algorithm for target set selection problems (Q2629957) (← links)
• On the bicriterion - minimal cost/minimal label - spanning tree problem (Q2655606) (← links)
• Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem (Q2655608) (← links)
• Fuzzy α-minimum spanning tree problem: definition and solutions (Q2817092) (← links)
• C-semiring Frameworks for Minimum Spanning Tree Problems (Q3184724) (← links)
• Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm (Q3612895) (← links)
• An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (Q5247677) (← links)
• Quadratic bottleneck problems (Q5392805) (← links)
• The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396) (← links)
• Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)