Table of Contents
Part I Theoretical Problems / Uncertainty / Graph Theory / Network Design
On the Design of Optical Ofdm-Based Networks Amal Benhamiche Ridha Mahjoub Nancy Perrot 1
An Exact Algorithm for Robust Network Design Christoph Buchheim Frauke Liers Laura Sanità 7
SRG-Disjoint Design with Dedicated and Shared Protection Bernardetta Addis Giuliana Carello Federico Malucelli 18
Improved Formulations for the Ring Spur Assignment Problem Paula Carroll Bernard Fortz Martine Labbé Seán McGarraghy 24
A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks Grit Claβen David Coudert Arie M.C.A. Koster Napoleão Nepomuceno 37
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem Alexandre Salles da Cunha Luidi Simonetti Abilio Lucena 43
Negative Cycle Separation in Wireless Network Design Fabio D'Andreagiovanni Carlo Mannino Antonio Sassano 51
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes Stefan Gollowitzer Luís Gouveia Ivana Ljubic 57
The Two Level Network Design Problem with Secondary Hop Constraints Stefan Gollowitzer Luís Gouveia Ivana Ljubic 71
Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks Luís Gouveia Pedro Moura Amaro de Sousa 77
Reformulation by Intersection Method on the Mst Problem With Lower Bound on the Number of Leaves Luís Gouveia João Telhada 83
A Polyhedral Approach for Solving Two Facility Network Design Problem Faiz Hamid Yogesh K. Agarwal 92
Ftth Network Design under Oa&m Constraints Matthieu Chardy Cedric Hervet 98
Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints Johannes Inführ Günther R. Raidl 105
Cutset Inequalities for Robust Network Design Arier M.C.A. Koster Manuel Kutschka Christian Raack 118
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem Markus Leitner Mario Ruthmair Günther R. Raidl 124
A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem Ivana Ljubic Peter Putz Juan-José Salazar-González 139
The Two Layer Network Design Problem Sara Mattia 145
Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing Michael Poss Christian Raack 150
On the Weight-Constrained Minimum Spanning Tree Problem Agostinho Agra Adelaide Cerveira Cristina Requejo Eulália Santos 156
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm Luídi Simonetti Alexandre Salles da Cunha Abilio Lucena 162
Multilayer Survivable Optical Network Design Sylvie Borne Virginia Gabrel Ridha Mahjoub Raouia Taktak 170
Hop-Level Flow Formulation for the Hop constrained Survivable Network Design Problem Ridha Mahjoub Luidi Simonetti Eduardo Uchoa 176
Part II Network Flow
Maximum Delay Computation under Traffic Matrix Uncertainty and Its Application to Interdomain Path Selection Isabel Amigo Sandrine Vaton Thierry Chonavel Federor Larroca 182
The Spatially Equitable Multicommodity Capacitated Network Flow Problem Paolo Dell'Olmo Antonino Sgalambro 196
Approximating Minimum Cut with Bounded Size Giulia Galbiati 210
Lexicographical Minimization of Routing Hops in Telecommunication Networks Luís Gouveia Pedro Patrício Amaro de Sousa 216
A Method for Obtaining the Maximum (δ, η)-Balanced Flow in a Network Wataru Kishimoto 230
Quickest Cluster Flow Problems on Tree Networks Kathrin Leiner Stefan Ruzika 243
Strong Duality for the Maximum Borel Flow Problem Ronald Koch Ebrahim Nasrabadi 256
Modeling the Gateway Location Problem for Multicommodity Flow Rerouting Maurizio Bruglieri Paola Cappanera Alberto Colorni Maddalena Nonato 262
Affine Decision Rules for Tractable Approximations to Robust Capacity Planning in Telecommunications Adam Ouorou 277
Optimal Download Time in a Cloud-Assisted Peer-to-Peer Video on Demand Service Pablo Rodríguez-Bocca Claudia Rostagnol 283
The Maximum Flow Problem with Conflict and Forcing Conditions Ulrich Pferschy Joachim Schauer 289
Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems Katherine C. Hastings Douglas R. Shier 295
Reliable and Restricted Quickest Path Problems Stefan Ruzika Markus Thiemann 309
Modeling and Optimization of Production and Distribution of Drinking Water at Vmc Derek Verleye El-Houssaine Aghezzaf 315
Part III Routing and Transportation
On the Hazmat Transport Network Design Problem Edoardo Amaldi Maurizio Bruglieri Bernard Fortz 327
Complexity of Inverse Shortest Path Routing Mikael Call Kaj Holmberg 339
The Skill Vehicle Routing Problem Paola Cappanera Luís Gouveia Maria Grazia Scutellá 354
The Bio ejective Inventory Routing Problem-Problem Solution and Decision Support Martin Josef Geiger Marc Sevaux 365
Problem Transformations for Vehicle Routing and Scheduling in the European Union Asvin Goel 379
New Models for and Numerical Tests of the Hamiltonian p-Median Problem Stefan Gollowitzer Dilson Lucas Pereira Adam Wojciechowski 385
Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search Mirko Maischberger Jean-François Cordeau 395
The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic I. Rodríguez-Martín Juan José Salazar-González 401
An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes M. Angélica Salazar-Aguilar André Langevin Gilbert Laporte 406
A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking Fernando Afonso Santos Geraldo Robson Mateus Alexandre Salles da Cunha 412
Impacts of Imprecise Demand Forecasts in Network Capacity Control: An Online Analysis Jörn Schönberger Herbert Kopfer 426
A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem Nora-Touati-Moungla Pietro Belotti Vincent Jost Leo Liberti 439
A Matheuristic for the Dial-a-Ride Problem Roberto Wolfler Calvo Nora Touati-Moungla 450
Part IV Further Optimization Problems and Applications
A Milp-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing Edoardo Amaldi Antonio Capone Luca G. Gianoli Luca Mascetti 464
Designing Ac Power Grids Using Integer Linear Programming Arie M.C.A. Koster Stephan Lemkens 478
Energy Saving in Fixed Wireless Broadband Networks David Coudert Napoleão Nepomuceno Issam Tahiri 484
Mip Modeling of Incremental Connected Facility Location Ashwin Arulselvan Andreas Bley Stefan Gollowitzer Ivana Ljubic Olaf Maurer 490
A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation Boris Goldengorin Dmitry Krushinsky 503
Cache Location in Tree Networks: Preliminary Results Bauguion Pierre Ben Ameur Walid Gourdin Eric 517
The Multi Terminal q-FlowLoc Problem: A Heuristic Stephanie Heller Horst W. Hamacher 523
Optimal Bandwidth Allocation in Mesh-Based Peer-to-Peer Streaming Networks María Elisa Bertinat Darío Padula Franco Robledo Amoza Pablo Rodríguez-Bocca Pablo Romero 529
Hub Location Problems with Choice of Different Hub Capacities and Vehicle Types Julia Sender Uwe Clausen 535
A Stochastic Optimization Model for Positioning Disaster Response Facilities for Large Scale Emergencies Anurag Verma Gary M. Gaukler 547
Efficient Robust Linear Optimization for Large Repositioning Problems Haris Gavranovic Mirsad Buljubašic 553
Robust Supply Vessel Planning Elin E. Halvorsen-Weare Kjetil Fagerholt 559
A Liner Shipping Network Design-Routing and Scheduling Impacted by Environmental Influences Volker Windeck Hartmut Stadtler 574
A Vnd-Ils Heuristic to Solve the Rwa Problem Alexandre Xavier Martins Christophe Duhamel Mauricio Cardoso de Souza Rodney Rezende Saldanha Philippe Mahey 577
Recoverable Robust Knapsacks: T-Scenarios Christina Büsing Arie M.C.A. Koster Manuel Kutschka 583
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem Francesco Carrabs Raffaele Cerulli Monica Gentili Gennaro Parlato 589
Cuts, c-Cuts, and c-Complexes over the n-Cube M. Reza Emamy-Khansary 603
Exact and Metaheuristic Approaches to Extend Lifetime and Maintain Connectivity in Wireless Sensors Networks Andrea Raiconi Monica Gentili 607
Computing Upper Bounds for a Lbpp With and Without Probabilistic Constraints Hugo Rodríguez Pablo Adasme Abdel Lisser Ismael Soto 620
Mixed Integer Programming Model for Pricing in Telecommunication Mustapha Bouhtou Jean-Robin Medori Michel Minoux 626
Ul Rssi as a Design Consideration for Distributed Antenna Systems, Using a Radial Basis Function Model for Ul Rssi Sarel Roets Praven Reddy Poovendren Govender 631
Handling Rest Requirements and Preassigned Activities in Airline Crew Pairing Optimization Michael Römer Taïeb Mellouli 643
On the Cover Scheduling Problem in Wireless Sensor Networks André Rossi Marc Sevaux, Alok Singh Martin Josef Geiger 657
Author Index 669
