Program for stream Contributed abstracts

SB-01: Network optimization
Stream: Contributed abstracts
Room:
Chair(s): Luís Gouveia

• On the Convex Piecewise Linear Unsplittable Multicommodity Flow Problem
  Bernard Fortz, Luís Gouveia, Martim Joyce-Moniz
• Finding maximum subgraphs with relatively large vertex connectivity
  Vladimir Boginski, Alexander Veremyev, Oleg Prokopyev, Eduardo Pasiliao
• Optimal Traffic Routing and VNF deployment for Service Function Chaining in SDN
  Nancy Perrot, Zaid Allybokus , Eric Gourdin

SC-01: Handling uncertainty
Stream: Contributed abstracts
Room:
Chair(s): Walid Ben-Ameur

• Learning Uncertainty Sets for Robust Network Optimization Problems
  Dimitri Papadimitriou
• Handling uncertain behavior of clients during FTTH splitter allocation
  Mateusz Żotkiewicz
• Spectrum Allocation in Flexgrid Optical Networks under Demand Uncertainty: Complexity and Computations
  Arie Koster, Christina Büsing, Martin Tieves
• Impact of perceived risk on consumer e-shopping behavior across device types.
  Stanko Dimitrov, Brian Cozzarin

SD-01: Wireless Networks I
Stream: Contributed abstracts
Room:
Chair(s): Arie Koster

• On Accurate Optimization Models for Interference-Constrained Resource Allocation in Cellular Networks
  DI YUAN, Grit Claßen, Arie Koster, Anke Schmeink
• Radio Frequency and Time-slot assignment in Mobile Adhoc Networks: An Exact Mathematical solution
  David Foroudi

MA-01: Wireless Networks II
Stream: Contributed abstracts
Room:
Chair(s): DI YUAN

• Airborne Recovery of the Emergency Communication Network during Disaster Response
  Recep Berk Ozgur, Burak Sever, Sezgin Kaplan
• Mathematical optimization tool for real-time practical solutions to dynamic network routing, connectivity and reliability
  David Foroudi
• Hybrid Accuracy-Time Trade-off Solution for Spectrum Sensing in Cognitive Radio Networks
  Albena Mihovska, Antoni Ivanov, Vladimir Poulkov, Ramjee Prasad

MB-01: Trees
Stream: Contributed abstracts
Room:
Chair(s): S. Raghavan

• Spanning Trees with a contraint on the number of leaves. A new formulation
  Luís Gouveia, Luidi Simonetti
• Solving Minimum-Cost Shared Arborescence Problems
  Ivana Ljubic, Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl
• A BIASED RANDOM-KEY GENETIC ALGORITHM FOR THE CAPACITATED MINIMUM SPANNING TREE PROBLEM
  Mauricio Resende, Efrain Ruiz, Maria Albareda Sambola, Elena Fernandez

TA-01: Energy efficient networks
Stream: Contributed abstracts
Room:
Chair(s): Ivana Ljubic

• An MIP for Energy-efficient Data Center: Reformulation for Distributed Computing and Server Clustering
  Yongkyu Cho, YOUNG MYOUNG KO
• The Virtual Network Embedding Problem: Complexity and Dynamic Programming
  Martin Tieves, Edoardo Amaldi, Stefano Coniglio, Arie Koster