Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
From MaRDI portal
Publication:932185
DOI10.1016/j.ejor.2006.12.061zbMath1160.90499OpenAlexW2082281445MaRDI QIDQ932185
Pedro Martins, Mauricio C. de Souza
Publication date: 10 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.061
variable neighborhood searchdegree constrained minimum spanning treesecond order algorithmskewed VNSVNS shaking phase
Related Items (9)
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations ⋮ Degree-constrained \(k\)-minimum spanning tree problem ⋮ The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm ⋮ Relations, models and a memetic approach for three degree-dependent spanning tree problems ⋮ Variable neighbourhood search: methods and applications ⋮ DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH ⋮ VNS and second order heuristics for the min-degree constrained minimum spanning tree problem ⋮ Variable neighbourhood search: Methods and applications ⋮ Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
Cites Work
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Looking ahead with the pilot method
- Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Variable neighborhood search
- Variable neighborhood decomposition search
- Heuristics for the phylogeny problem
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
- Using Lagrangian dual information to generate degree constrained spanning trees
- A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- A branch and cut method for the degree-constrained minimum spanning tree problem
- The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- A New Class of Algorithms for Multipoint Network Optimization
- Variable Neighborhood Search
- Using constraint-based operators to solve the vehicle routing problem with time windows
- Comparison of algorithms for the degree constrained minimum spanning tree
This page was built for publication: Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
