Generalized spanning trees
From MaRDI portal
Recommendations
- On the generalized minimum spanning tree problem
- New models of the generalized minimum spanning tree problem
- A new relaxation method for the generalized minimum spanning tree problem
- Relaxation methods for the Generalized Minimum Spanning Tree problem
- A note on the complexity of the generalized minimum spanning tree problem
Cites work
- scientific article; zbMATH DE number 3677874 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3603173 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- A dual ascent approach for steiner tree problems on a directed graph
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
- Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Heuristics for the Steiner problem in graphs
- Network flows. Theory, algorithms, and applications.
- Steiner problem in networks: A survey
- Steiner's problem in graphs: Heuristic methods
- Survivable networks, linear programming relaxations and the parsimonious property
- The Steiner tree problem
- The traveling-salesman problem and minimum spanning trees: Part II
Cited in
(26)- The multicolored graph realization problem
- Solving group Steiner problems as Steiner problems.
- Expanders Are Universal for the Class of All Spanning Trees
- A two-level metaheuristic for the all colors shortest path problem
- General variable neighborhood search approach to group Steiner tree problem
- Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem
- On the prize-collecting generalized minimum spanning tree problem
- Generalized minimum spanning tree games
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- A two-level solution approach for solving the generalized minimum spanning tree problem
- Spanning trees and function classes
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
- Combinatorial optimization in system configuration design
- On generalized minimum spanning trees
- 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
- Generic Ising trees
- Generalized network design problems.
- Critical analysis of the spanning tree techniques
- Extension of spanning tree and applications
- The prize-collecting generalized minimum spanning tree problem
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
- A new relaxation method for the generalized minimum spanning tree problem
- Globally and locally minimal weight spanning tree networks
This page was built for publication: Generalized spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579496)
