Generalized spanning trees

DOI10.1016/S0377-2217(99)00006-5zbMath0985.90076OpenAlexW2172255557MaRDI QIDQ1579496

Moshe Dror, Mohamed Haouari, Jouhaina Siala Chaouachi

Publication date: 14 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00006-5

zbMATH Keywords

genetic algorithmsSteiner problemtraveling salesman problemminimum spanning treeagricultureworst case analysisirrigation network

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)

Related Items (20)

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 ⋮ 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 ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ Solving group Steiner problems as Steiner problems. ⋮ 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 ⋮ The prize-collecting generalized minimum spanning tree problem ⋮ On the prize-collecting generalized minimum spanning tree problem ⋮ On generalized minimum spanning trees ⋮ Globally and locally minimal weight spanning tree networks ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances ⋮ Generalized network design problems. ⋮ The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm ⋮ Combinatorial optimization in system configuration design ⋮ A new relaxation method for the generalized minimum spanning tree problem ⋮ Upper and lower bounding strategies for the generalized minimum spanning tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survivable networks, linear programming relaxations and the parsimonious property
• Heuristics for the Steiner problem in graphs
• Steiner's problem in graphs: Heuristic methods
• The Steiner tree problem
• A dual ascent approach for steiner tree problems on a directed graph
• A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
• Steiner problem in networks: A survey
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
• The traveling-salesman problem and minimum spanning trees: Part II
• Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity

This page was built for publication: Generalized spanning trees