A tabu search heuristic for the Steiner Tree Problem
From MaRDI portal
Publication:4267398
DOI<162::AID-NET9>3.0.CO;2-9 10.1002/(SICI)1097-0037(199909)34:2<162::AID-NET9>3.0.CO;2-9zbMath0959.90059OpenAlexW1967744114MaRDI QIDQ4267398
Jean-Francois Larochelle, Brunilde Sansó, Michel Gendreau
Publication date: 4 October 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199909)34:2<162::aid-net9>3.0.co;2-9
Programming involving graphs or networks (90C35) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
Designing a road network for hazardous materials shipments, Solving the quadratic minimum spanning tree problem, Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic, Solving Steiner trees: Recent advances, challenges, and perspectives, Optimizing the Design of a Wind Farm Collection Network, Viral systems: A new bio-inspired optimisation approach, Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
Uses Software
Cites Work
