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.

On the complexity of column generation in survivable network design with path-based survivability mechanisms

In English

Författare

  • Sebastian Orlowski
  • Michal Pioro

Summary, in English

This paper deals with path-based linear programming formulations in survivable network design. In a recent

survey we have investigated the complexity of the column generation problems for a large variety of protection

and restoration mechanisms in a single or multiple link failure scenario, and classified them according to their

structure. It turned out that all the considered column generation problems are composed of only few building

blocks which determine their complexity. In this paper, we summarize our findings and give an example for each

of these building blocks.

Publiceringsår

2009

Språk

Engelska

Dokumenttyp

Konferensbidrag

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

International Network Optimization Conference INOC’2009

Conference date

2009-04-26 - 2009-04-29

Conference place

Pisa, Italy

Status

Published

Forskningsgrupp

  • Networking