Projekt 2
Poster
Publications
Presentations

Project 2: Proaktive Optimierungsmodelle für Netze mit unsicheren Anforderungen

(Proactive optimization model for networks with reliability requirements)

Affiliation

RWTH Aachen

Lehrstuhl II für Mathematik
RWTH Aachen University

Prof. Dr. Arie M.C.A. Koster
    Dr. Stefano Coniglio,
    M.Sc. Martin Tieves

Content

The subproject aims at providing solutions to the VNE and Flexgrid problems in cases of data uncertainty. We assume that the nominal data taken as input for the two problems might differ from the real data due to, e.g., measurement errors or unpredictable changes in what was considered as a given. In this setting, the focus is on defining so-called uncertainty sets, representing (explicitly or implicitly) a set of realistic scenarios, e.g., of realizations of the uncertain data. Mathematical models and optimization algorithms are then designed so to produce solutions that are robust under uncertainty, i.e., feasible with respect to all the realizations described in the uncertainty sets.

Poster

In the context of the DRCN conference 2015, we prepared a poster summarizing the results of our paper on robust virtual network embedding. Click on the picture to download. DRCN Poster is busy!










Publications

6 results
2015
[6] Optimal offline virtual network embedding with rent-at-bulk aspects (, , , , ), In CoRR, volume abs/1501.07887, .
[bibtex] [pdf]
[5]On the generation of cutting planes which maximize the bound improvement (, ), In International Symposium on Experimental Algorithms (SEA), .
[bibtex]
[4] Network design with compression: complexity and algorithms (, ), In INFORMS Computing Society Conference (INFORMS ICS), .
[bibtex] [pdf]
[3]On the computational complexity of the virtual network embedding problem (, , , ), In International Network Optimization Conference (INOC), .
[bibtex]
[2] Virtual network embedding under uncertainty: exact and heuristic approaches (, , ), In Design of Reliable Communication Networks (DRCN), .
[bibtex] [pdf]
2014
[1] Maximum throughput network routing subject to fair flow allocation (, , ), In Combinatorial Optimization, LNCS, volume 8596, .
[bibtex] [pdf]

Presentations

24 results
2015
[24]Bound optimal cutting planes: on the genration of cuts which maximize the bound improvement (, ), . (Annual Conference of the French Operations Research Society (ROADEF))
[bibtex]
[23]On the generation of cutting planes which maximize the bound improvement (, ), . (International Symposium on Experimental Algorithms (SEA))
[bibtex]
[22]Robust optimization approaches for virtual network service providers (, , ), . (International Network Optimization Converence (INOC))
[bibtex]
[21]Network design with compression: the difficulty of compressor placement (, ), . (International Network Optimization Converence (INOC))
[bibtex]
[20]On the computational complexity of the virtual network embedding problem (, , , ), . (International Network Optimization Converence (INOC))
[bibtex]
[19]Virtual Network Embedding under Uncertainty: Exact and Heuristic Approaches (, , ), . (Design of Reliable Communication Networks (DRCN))
[bibtex]
[18]Network Design with Compression: Complexity and Algorithms (, ), . (INFORMS Computing Society Conference(ICS))
[bibtex]
2014
[17]Complexity results for network design with compression (, ), . (International Conference on Operations Research (GOR))
[bibtex]
[16]Network design under multisource uncertainty (, ), . (Conference of the International Federation of Operational Research Societies (IFORS))
[bibtex]
[15]On the Complexity of Network Design with Compression (, ), . (SophiaTech networks seminar)
[bibtex]
[14]Network Design under Compression and Caching Rates Uncertainty (, ), . (SIAM Conference on Optimization)
[bibtex]
[13]On the exact separation of rank inequalities for the maximum stable set problem (, ), . (Integer Programming and Combinatorial Optimizaton (IPCO), Poster)
[bibtex]
[12]Complexity of Network Design with Caching (, ), . (Treewidth And Combinatorial Optimization (TACO) Day)
[bibtex]
[11]On the exact separation of rank inequalities for the stable set problem" (, ), . (International Symposium on Combinatorial Optimization (ISCO))
[bibtex]
[10]A modeling framework for multiple sources of data uncertainty in combinatorial optimization problems (, ), . (International Symposium on Combinatorial Optimization (ISCO))
[bibtex]
[9]Bilevel optimization models for traffic engineering with elastic demands and fair flow allocation (, , , ), . (INFORMS Telecommunications Conference (INFORMS TELECOM))
[bibtex]
[8]Network design with compression II: a complexity study (, ), . (INFORMS Telecommunications Conference (INFORMS TELECOM))
[bibtex]
[7]Virtual Network Embedding: Models, Complexity, and Computations (), . (Seminar Université Libre de Bruxelles)
[bibtex]
[6]Novel Approaches to Network Design (), . (Jahrestagung der Österreichischen Gesellschaft für Operations Research (ÖGOR))
[bibtex]
[5]On the exact separation of rank inequalities for the maximum stable set problem (, ), . (Invited Seminar, Zuse Institute Berlin(ZIB))
[bibtex]
[4]Robust optimization approaches to virtual network embedding (, , ), . (INFORMS Annual Meeting (INFORMS))
[bibtex]
[3]Virtual network embedding with network design elements: reservation of physical resources (, , ), . (INFORMS Annual Meeting (INFORMS))
[bibtex]
[2]On the generation of cuts which maximize the bound improvement (, ), . (Annual Conference of the Italian Operational Research Society (AIRO))
[bibtex]
[1]Network design with compression I: a polyhedral study (, ), . (INFORMS Telecommunications Conference (INFORMS TELECOM))
[bibtex]
Impressum Last modified: