Pages that link to "Item:Q1389197"

The following pages link to An effective genetic algorithm approach to the quadratic minimum spanning tree problem (Q1389197):

Displaying 15 items.

• Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
• Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
• Solving the quadratic minimum spanning tree problem (Q387698) (← links)
• Combinatorial optimization with one quadratic term: spanning trees and forests (Q406320) (← links)
• Fuzzy quadratic minimum spanning tree problem (Q556109) (← links)
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
• The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
• A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825) (← links)
• Genetic algorithm approach on multi-criteria minimum spanning tree problem (Q1809832) (← links)
• Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem (Q2178061) (← links)
• Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297) (← links)
• Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems (Q2371985) (← links)
• Fuzzy α-minimum spanning tree problem: definition and solutions (Q2817092) (← links)
• Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
• (Q5743409) (← links)