Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

Författare

  • 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.

Publiceringsår

2014

Språk

Engelska

Publikation/Tidskrift/Serie

[Host publication title missing]

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • 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