NEW METAHEURISTIC APPROACHES FOR THE LEAF-CONSTRAINED MINIMUM SPANNING TREE PROBLEM

DOI10.1142/S0217595908001870zbMath1151.90591OpenAlexW2088797223MaRDI QIDQ3528873

Alok Singh, Anurag Singh Baghel

Publication date: 17 October 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595908001870

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

An order-based algorithm for minimum dominating set with application in graph mining

Cites Work

• New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
• A study of ACO capabilities for solving the maximum clique problem

This page was built for publication: NEW METAHEURISTIC APPROACHES FOR THE LEAF-CONSTRAINED MINIMUM SPANNING TREE PROBLEM