An improved Benders decomposition applied to a multi-layer network design problem
Benders decomposition has been widely used for solving network design problems. In this
paper, we use a branch-and-cut algorithm to improve the separation procedure of Gabrel et …
paper, we use a branch-and-cut algorithm to improve the separation procedure of Gabrel et …
On cut‐based inequalities for capacitated network design polyhedra
In this article, we study capacitated network design problems. We unify and extend
polyhedral results for directed, bidirected, and undirected link capacity models. Valid …
polyhedral results for directed, bidirected, and undirected link capacity models. Valid …
The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs
T Achterberg, C Raack - Mathematical Programming Computation, 2010 - Springer
Given a general mixed integer program, we automatically detect block structures in the
constraint matrix together with the coupling by capacity constraints arising from multi …
constraint matrix together with the coupling by capacity constraints arising from multi …
Single-layer cuts for multi-layer network design problems
We study a planning problem arising in SDH/WDM multi-layer telecommunication network
design. The goal is to find a minimum cost installation of link and node hardware of both …
design. The goal is to find a minimum cost installation of link and node hardware of both …
[PDF][PDF] Optimal design of survivable multi-layer telecommunication networks
S Orlowski - 2009 - depositonce.tu-berlin.de
Telecommunication transport networks consist of a stack of technologically different
subnetworks, so-called layers, which are strongly interdependent. For example, one layer …
subnetworks, so-called layers, which are strongly interdependent. For example, one layer …
Multi-layer network design-A model-based optimization approach
A Bley, R Klaehne, U Menne, C Raack, R Wessäly - 2009 - opus4.kobv.de
In this paper, we present a model-based optimization approach for the design of multi-layer
networks. The proposed framework is based on a series of increasingly abstract models …
networks. The proposed framework is based on a series of increasingly abstract models …
Capacitated network design: Multi-commodity flow formulations, cutting planes, and demand uncertainty
C Raack - … Research Proceedings 2013: Selected Papers of the …, 2014 - Springer
This article provides an overview about the main results and findings developed in the
dissertation of the author [8]. In this thesis, we develop methods in mathematical optimization …
dissertation of the author [8]. In this thesis, we develop methods in mathematical optimization …
[PDF][PDF] On the strength of cut-based inequalities for capacitated network design polyhedra
C Raack, AMCA Koster, R Wessäly - 2007 - opus4.kobv.de
In this paper we study capacitated network design problems, differentiating directed,
bidirected and undirected link capacity models. We complement existing polyhedral results …
bidirected and undirected link capacity models. We complement existing polyhedral results …
[LIBRO][B] Discrete approaches for optimal routing of high pressure pipes
J Schelbert - 2015 - opus4.kobv.de
The planning of a whole power plant involves diversivied specializations in engineering and
can take up to several years. Within the planning procedure the routing of the high pressure …
can take up to several years. Within the planning procedure the routing of the high pressure …
Benchmarking RWA strategies for dynamically controlled optical networks
AMCA Koster, S Ruepp - Networks 2008-The 13th International …, 2008 - ieeexplore.ieee.org
We present two studies to benchmark Routing and Wavelength Assignment (RWA)
strategies which have been developed for dynamically controlled optical networks. In a first …
strategies which have been developed for dynamically controlled optical networks. In a first …