A two-level solution approach for solving the generalized minimum spanning tree problem

DOI10.1016/j.ejor.2017.08.015zbMath1374.90396OpenAlexW2745422985MaRDI QIDQ1681269

Petrică C. Pop, Cosmin Sabo, Adrian Petrovan, Oliviu Matei

Publication date: 23 November 2017

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.08.015

zbMATH Keywords

dynamic programmingcombinatorial optimizationgenetic algorithmsdecomposition methodsgeneralized minimum spanning tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (4)

The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ 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 ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances

Cites Work

• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Generalized network design problems. Modeling and optimization.
• New models of the generalized minimum spanning tree problem
• Upper and lower bounding strategies for 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
• Stochastic spanning tree problem
• Generalized spanning trees
• The origins of minimal spanning tree algorithms -- Borůvka and Jarník
• The prize-collecting generalized minimum spanning tree problem
• On the prize-collecting generalized minimum spanning tree problem
• A new relaxation method for the generalized minimum spanning tree problem
• A comparative analysis of several formulations for the generalized minimum spanning tree problem
• Heuristic Search for the Generalized Minimum Spanning Tree Problem
• The probabilistic minimum spanning tree problem
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
• On the generalized minimum spanning tree problem
• On generalized minimum spanning trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A two-level solution approach for solving the generalized minimum spanning tree problem