A new relaxation method for the generalized minimum spanning tree problem

DOI10.1016/J.EJOR.2004.07.058zbMATH Open1091.90068OpenAlexW2077405310MaRDI QIDQ2575572FDOQ2575572

Yanyan Li

Publication date: 5 December 2005

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

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

zbMATH Keywords

combinatorial optimizationminimum spanning treesgeneralized minimum spanning tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Expressing combinatorial optimization problems by linear programs
• Generalized spanning trees
• A comparative analysis of several formulations for the generalized minimum spanning tree problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• On generalized minimum spanning trees
• Generalized Steiner problems and other variants

Cited In (18)

• A two-level metaheuristic for the all colors shortest path problem
• An efficient mixed integer linear programming model for the minimum spanning tree problem
• The tree of hubs location problem
• A rapid learning automata-based approach for generalized minimum spanning tree problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
• Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• A two-level solution approach for solving the generalized minimum spanning tree problem
• An improved hybrid ant-local search algorithm for the partition graph coloring problem
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
• An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
• Generalized spanning trees
• On generalized minimum spanning trees
• A tabu search heuristic for the generalized minimum spanning tree problem
• A new rule for source connection problems
• The prize-collecting generalized minimum spanning tree problem
• A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs

   Recommendations

• New models of the generalized minimum spanning tree problem 👍 👎
• Relaxation methods for the Generalized Minimum Spanning Tree problem 👍 👎
• Title not available (Why is that?) 👍 👎
• On the generalized minimum spanning tree problem 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A new relaxation method for the generalized minimum spanning tree problem

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