On minimum congestion routing in rearrangeable multihop lightwave networks

DOI10.1007/BF02430369zbMath0857.90040OpenAlexW2048626871MaRDI QIDQ1922634

Jadranka Skorin-Kapov, Jean-François Labourdette

Publication date: 1 September 1996

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02430369

zbMATH Keywords

optical networksNP-hard combinatorial problemcongestion in logically rearrangeable multihop lightwave networkstabu search-based heuristic

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items

Metaheuristics: A bibliography

Uses Software

• CPLEX

Cites Work

• Computational experience with a difficult mixed-integer multicommodity flow problem
• Tabu Search—Part I
• Tabu Search—Part II
• The flow deviation method: An approach to store‐and‐forward communication network design