DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH

DOI10.1080/01969722.2012.637012zbMath1331.90058OpenAlexW2063966527MaRDI QIDQ2790350

Javad Akbari Torkestani

Publication date: 4 March 2016

Published in: Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01969722.2012.637012

zbMATH Keywords

samplinglearning automatastochastic graphdegree-constrained minimum spanning tree problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Fuzzy α-minimum spanning tree problem: definition and solutions ⋮ Learning Automaton and Its Variants for Optimization: A Bibliometric Analysis

Cites Work

• Unnamed Item
• Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
• VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
• A Lagrangean approach to the degree-constrained minimum spanning tree problem
• Transitions in geometric minimum spanning trees
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
• Using Lagrangian dual information to generate degree constrained spanning trees
• On two geometric problems related to the travelling salesman problem
• Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory
• Learning Optimal Discriminant Functions through a Cooperative Game of Automata
• Comparison of algorithms for the degree constrained minimum spanning tree

This page was built for publication: DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH