Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints

DOI10.1016/J.EJOR.2007.06.012zbMATH Open1146.90343OpenAlexW2037357784MaRDI QIDQ2482819FDOQ2482819

Authors: Alysson M. Costa, Jean-François Cordeau, G. Laporte 

Publication date: 24 April 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.2007.06.012

Recommendations

• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
• The Steiner tree problem with hop constraints

zbMATH Keywords

heuristicsnetwork designSteiner tree problemtabu searchhop constraintsbudgetprize collecting

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Title not available (Why is that?)
• A general heuristic for vehicle routing problems
• The Steiner tree problem with hop constraints
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Multicommodity flow models for spanning trees with hop constraints
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• A guide to vehicle routing heuristics
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• A Steiner arborescence model for the feeder reconfiguration in electric distribution networks
• Packet Routing in Telecommunication Networks with Path and Flow Restrictions
• Title not available (Why is that?)
• Steiner Tree Problems With Profits
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs

Cited In (16)

• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
• An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions
• A branch-and-cut algorithm for the Steiner tree problem with delays
• Optimal relay node placement in delay constrained wireless sensor network design
• Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• Combinatorial optimization in system configuration design
• Optimal network design with end-to-end service requirements
• A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
• A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks
• Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
• Steiner Tree Problems With Profits
• A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
• Breakout local search for the Steiner tree problem with revenue, budget and hop constraints

Uses Software

• OR-Library

This page was built for publication: Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482819)