On the generalized minimum spanning tree problem
From MaRDI portal
Publication:4894860
DOI10.1002/net.3230260407zbMath0856.90117OpenAlexW2032789430MaRDI QIDQ4894860
Dong-wan Tcha, Chang Ho Lee, Young-Soo Myung
Publication date: 7 October 1996
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230260407
Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05)
Related Items (39)
A two-level metaheuristic for the all colors shortest path problem ⋮ Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem ⋮ Generalized minimum spanning tree games ⋮ Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems ⋮ Looking for edge-equitable spanning trees ⋮ Approximation Algorithms for Generalized MST and TSP in Grid Clusters ⋮ Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem ⋮ Unnamed Item ⋮ An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties ⋮ The geometric generalized minimum spanning tree problem with grid clustering ⋮ A two-level solution approach for solving the generalized minimum spanning tree problem ⋮ General variable neighborhood search approach to group Steiner tree problem ⋮ An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search ⋮ Continuous approximation formulas for location problems ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm ⋮ Vertex covering with capacitated trees ⋮ Unnamed Item ⋮ Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds ⋮ A tabu search heuristic for the generalized minimum spanning tree problem ⋮ Branch-and-bound for the precedence constrained generalized traveling salesman problem ⋮ Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem ⋮ The prize-collecting generalized minimum spanning tree problem ⋮ On the prize-collecting generalized minimum spanning tree problem ⋮ A survey on Benders decomposition applied to fixed-charge network design problems ⋮ On generalized minimum spanning trees ⋮ A comparative analysis of several formulations for the generalized minimum spanning tree problem ⋮ A rapid learning automata-based approach for generalized minimum spanning tree problem ⋮ The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search ⋮ The generalized minimum branch vertices problem: properties and polyhedral analysis ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances ⋮ Approximation algorithms for group prize-collecting and location-routing problems ⋮ An improved hybrid ant-local search algorithm for the partition graph coloring problem ⋮ Generalized network design problems. ⋮ The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm ⋮ Generalized network design polyhedra ⋮ Unnamed Item ⋮ Upper and lower bounding strategies for the generalized minimum spanning tree problem
Cites Work
This page was built for publication: On the generalized minimum spanning tree problem
