The geometric generalized minimum spanning tree problem with grid clustering

DOI10.1007/S10288-006-0012-6MaRDI QIDQ882648zbMATH OpenOpenAlexFDO

Authors Corinne Feremans, Alexander Grigoriev, René A. Sitters

Publication date 24 May 2007

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-006-0012-6

zbMATH Keywords

approximationscomplexitygeneralized minimum spanning treegrid clustering

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Dynamic programming (90C39)

Recommendations

• New models of the generalized minimum spanning tree problem
• On the generalized minimum spanning tree problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• Upper and lower bounding strategies for the generalized minimum spanning tree problem
• Approximation theory in combinatorial optimization. Application to the generalized minimum spanning tree problem

Cites work

• Generalized network design problems.
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2037815 (Why is no real title available?)
• New models of the generalized minimum spanning tree problem
• On generalized minimum spanning trees
• On the generalized minimum spanning tree problem
• Solving group Steiner problems as Steiner problems.

Cited in

(9)

• A two-level solution approach for solving the generalized minimum spanning tree problem
• Approximation schemes for the generalized traveling salesman problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
• Approximation algorithms for generalized MST and TSP in grid clusters
• An application of the minimal spanning tree approach to the cluster stability problem
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
• Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem

This page was built for publication: The geometric generalized minimum spanning tree problem with grid clustering

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