Variable neighborhood search for the degree-constrained minimum spanning tree problem
From MaRDI portal
Publication:1348252
DOI10.1016/S0166-218X(01)00255-4zbMath0994.90123OpenAlexW2063193808MaRDI QIDQ1348252
Maurício C. Souza, Celso Carneiro Ribeiro
Publication date: 15 May 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00255-4
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (28)
A variable neighbourhood search algorithm for the flexible job-shop scheduling problem ⋮ Optimal capacitated ring trees ⋮ Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations ⋮ Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations ⋮ Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems ⋮ Hybrid Metaheuristics: An Introduction ⋮ Fixed parameter tractability of a biconnected bottleneck Steiner network problem ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ An ant colony optimisation algorithm for scheduling in agile manufacturing ⋮ Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem ⋮ The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm ⋮ Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs ⋮ New genetic algorithm approach for the MIN-degree constrained minimum spanning tree ⋮ A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure ⋮ Relations, models and a memetic approach for three degree-dependent spanning tree problems ⋮ Variable neighbourhood search: methods and applications ⋮ Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm ⋮ Using Lagrangian dual information to generate degree constrained spanning trees ⋮ Randomized heuristics for the Max-Cut problem ⋮ Theoretical insights into the augmented-neural-network approach for combinatorial optimization ⋮ DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH ⋮ A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application ⋮ Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints ⋮ VNS and second order heuristics for the min-degree constrained minimum spanning tree problem ⋮ Variable neighbourhood search: Methods and applications ⋮ Design of capacitated degree constrained min-sum arborescence ⋮ Network design for time‐constrained delivery ⋮ Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge exchanges in the degree-constrained minimum spanning tree problem
- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
- Variable neighborhood search
- Greedy randomized adaptive search procedures
- Topological design of centralized computer networks—formulations and algorithms
- A More Portable Fortran Random Number Generator
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- A note on genetic algorithms for degree-constrained spanning tree problems
- Recent Developments in Computer Implementation Technology for Network Flow Algorithms
- Comparison of algorithms for the degree constrained minimum spanning tree
This page was built for publication: Variable neighborhood search for the degree-constrained minimum spanning tree problem
