The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Valid Inequalities for the Routing and Spectrum Allocation Problem in Elastic Optical Networks

På svenska

Author

  • M. Klinkowski
  • Michal Pioro
  • M. Żotkiewicz
  • M. Ruiz
  • L. Velasco

Summary, in English

We deal with a natural integer-linear programming formulation of the routing and spectrum allocation (RSA) problem in elastic optical networks. We focus on strengthening the formulation with valid inequalities (cuts). For this purpose we apply clique inequalities that proved to be useful in other applications of this kind. We develop and combine a clique cut generation procedure with a column generation algorithm with the aim to improve the quality of generated columns. The presented results, obtained for a set of problem instances, illustrate the effectiveness of the optimization algorithm.

Publishing year

2014

Language

English

Publication/Series

[Host publication title missing]

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

16th International Conference on Transparent Optical Networks (ICTON)

Conference date

2014-07-06 - 2014-07-10

Conference place

Graz, Austria

Status

Published