New models of the generalized minimum spanning tree problem

DOI10.1023/B:JMMA.0000036579.83218.8dzbMath1084.90045OpenAlexW2078336410MaRDI QIDQ702364

Petrică C. Pop

Publication date: 17 January 2005

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jmma.0000036579.83218.8d

zbMATH Keywords

dynamic programmingNP-hardlinear relaxationMinimum spanning treegeneralized minimum spanning trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (9)

Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems ⋮ Selective generalized travelling salesman problem ⋮ The geometric generalized minimum spanning tree problem with grid clustering ⋮ A two-level solution approach for solving the generalized minimum spanning tree problem ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds ⋮ The prize-collecting generalized minimum spanning tree problem ⋮ Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles ⋮ Unnamed Item

This page was built for publication: New models of the generalized minimum spanning tree problem