Open AccessSolving routing and wavelength assignment problem with maximum edge-disjoint paths
Author(s) -
Chia-Chun Hsu,
Hsun-Jung Cho,
Shu-Cherng Fang
Publication year - 2016
Publication title -
journal of industrial and management optimization
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.325
H-Index - 32
eISSN - 1553-166X
pISSN - 1547-5816
DOI - 10.3934/jimo.2016062
Subject(s) - routing and wavelength assignment , computer science , wavelength division multiplexing , routing (electronic design automation) , network topology , bin packing problem , enhanced data rates for gsm evolution , set (abstract data type) , disjoint sets , mathematical optimization , wavelength , algorithm , computer network , mathematics , telecommunications , bin , optics , physics , combinatorics , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom