Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints

DOI10.1287/ijoc.2014.0622zbMath1329.90150OpenAlexW2057268736MaRDI QIDQ3466769

Jin-Kao Hao, Zhang-Hua Fu

Publication date: 25 January 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2014.0622

zbMATH Keywords

heuristicsdynamic programmingevolutionary computationcontent distribution networksconstrained Steiner trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Dynamic programming (90C39)

Related Items (3)

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints ⋮ Swap-vertex based neighborhood for Steiner tree problems ⋮ A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants

Uses Software

• OR-Library

Cites Work

• Solving the quadratic minimum spanning tree problem
• A hybrid metaheuristic approach to solving the UBQP problem
• New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
• The Steiner tree problem with hop constraints
• Unbounded knapsack problem: Dynamic programming revisited
• Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
• A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
• Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
• Heuristic Search for the Generalized Minimum Spanning Tree Problem
• An Encoding in Metaheuristics for the Minimum Communication Spanning Tree Problem
• State-of-the Art Review—Evolutionary Algorithms for Vehicle Routing
• The Complexity of Computing Steiner Minimal Trees
• A Gentle Introduction to Memetic Algorithms
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints

This page was built for publication: Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints