Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
From MaRDI portal
(Redirected from Publication:953318)
Recommendations
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Relaxation methods for the Generalized Minimum Spanning Tree problem
- New models of the generalized minimum spanning tree problem
- scientific article; zbMATH DE number 5621997
- A tabu search heuristic for the generalized minimum spanning tree problem
Cites work
- scientific article; zbMATH DE number 2037815 (Why is no real title available?)
- scientific article; zbMATH DE number 219265 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- Class Steiner trees and VLSI-design
- Generalized spanning trees
- Heuristic search for the generalized minimum spanning tree problem
- On generalized minimum spanning trees
- On the generalized minimum spanning tree problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- POPMUSIC -- partial optimization metaheuristic under special intensification conditions
- Solving group Steiner problems as Steiner problems.
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- The geometric generalized minimum spanning tree problem with grid clustering
Cited in
(19)- Variable neighbourhood search: Methods and applications
- General variable neighborhood search approach to group Steiner tree problem
- A tabu search heuristic for the generalized minimum spanning tree problem
- Variable neighbourhood search: methods and applications
- The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- A reactive GRASP with path relinking for capacitated clustering
- A two-level metaheuristic for the all colors shortest path problem
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
- A rapid learning automata-based approach for generalized minimum spanning tree problem
- scientific article; zbMATH DE number 5621997 (Why is no real title available?)
- A two-level solution approach for solving the generalized minimum spanning tree problem
- Hybrid adaptive large neighborhood search for the optimal statistic median problem
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
This page was built for publication: Combining variable neighborhood search with integer linear programming 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 Q953318)
