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




Related Items (28)

A variable neighbourhood search algorithm for the flexible job-shop scheduling problemOptimal capacitated ring treesMin-degree constrained minimum spanning tree problem: complexity, properties, and formulationsMin-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulationsCombining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problemsHybrid Metaheuristics: An IntroductionFixed parameter tractability of a biconnected bottleneck Steiner network problemMathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problemAn ant colony optimisation algorithm for scheduling in agile manufacturingSkewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problemThe min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithmModels and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costsNew genetic algorithm approach for the MIN-degree constrained minimum spanning treeA GRASP/VND heuristic for the phylogeny problem using a new neighborhood structureRelations, models and a memetic approach for three degree-dependent spanning tree problemsVariable neighbourhood search: methods and applicationsMulti-objective redundancy allocation optimization using a variable neighborhood search algorithmUsing Lagrangian dual information to generate degree constrained spanning treesRandomized heuristics for the Max-Cut problemTheoretical insights into the augmented-neural-network approach for combinatorial optimizationDEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPHA multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and applicationMin-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraintsVNS and second order heuristics for the min-degree constrained minimum spanning tree problemVariable neighbourhood search: Methods and applicationsDesign of capacitated degree constrained min-sum arborescenceNetwork design for time‐constrained deliveryBranch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem



Cites Work


This page was built for publication: Variable neighborhood search for the degree-constrained minimum spanning tree problem