LP-based heuristic algorithms for interconnecting token rings via source routing bridges
From MaRDI portal
Publication:556719
DOI10.1023/A:1009622011925zbMath1064.90579MaRDI QIDQ556719
June S. Park, Bezalel Gavish, Varadharajan Sridhar
Publication date: 22 June 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
multicommodity flowmixed integer linear programcapacitated network designLP-based heuristicssource routing bridge
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (3)
MILP-based heuristics for the design of rural community electrification projects ⋮ A survey on Benders decomposition applied to fixed-charge network design problems ⋮ Benders-and-cut algorithm for fixed-charge capacitated network design problem
This page was built for publication: LP-based heuristic algorithms for interconnecting token rings via source routing bridges
