scientific article; zbMATH DE number 2037815

MaRDI QIDQ4448919zbMATH OpenFDO

Authors Petrica Pop

Publication date 3 February 2004

zbMATH Keywords

approximation algorithmcombinatorial optimizationgeneralized minimum spanning tree

Mathematics Subject Classification ID

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

Recommendations

• An approximation algorithm for the least version of the generalized minimum spanning tree problem
• Approximation theory in combinatorial optimization. Application to the generalized minimum spanning tree problem
• On the generalized minimum spanning tree problem
• scientific article; zbMATH DE number 2201897
• A note on the complexity of the generalized minimum spanning tree problem
• On generalized minimum spanning trees
• A generalization of the minimum branch vertices spanning tree problem
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• Approximating the degree-bounded minimum diameter spanning tree problem
• Approximating the degree-bounded minimum diameter spanning tree problem

Cited in

(12)

• On the prize-collecting generalized minimum spanning tree problem
• A new relaxation method for the generalized minimum spanning tree problem
• Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• Approximation algorithms for generalized MST and TSP in grid clusters
• scientific article; zbMATH DE number 5621997 (Why is no real title available?)
• scientific article; zbMATH DE number 2201897 (Why is no real title available?)
• scientific article; zbMATH DE number 5876375 (Why is no real title available?)
• Approximation theory in combinatorial optimization. Application to the generalized minimum spanning tree problem
• The geometric generalized minimum spanning tree problem with grid clustering
• A tabu search heuristic for the generalized minimum spanning tree problem
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448919)