Table of Contents

• On the Design of Optical OFDM-Based NetworksAmal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot. 1-6 [doi]
• An Exact Algorithm for Robust Network DesignChristoph Buchheim, Frauke Liers, Laura Sanità. 7-17 [doi]
• SRG-Disjoint Design with Dedicated and Shared ProtectionBernardetta Addis, Giuliana Carello, Federico Malucelli. 18-23 [doi]
• Improved Formulations for the Ring Spur Assignment ProblemPaula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy. 24-36 [doi]
• A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless NetworksGrit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno. 37-42 [doi]
• Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest ProblemAlexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena. 43-50 [doi]
• Negative Cycle Separation in Wireless Network DesignFabio D'Andreagiovanni, Carlo Mannino, Antonio Sassano. 51-56 [doi]
• A Node Splitting Technique for Two Level Network Design Problems with Transition NodesStefan Gollowitzer, Luis Gouveia, Ivana Ljubic. 57-70 [doi]
• The Two Level Network Design Problem with Secondary Hop ConstraintsStefan Gollowitzer, Luís Gouveia, Ivana Ljubic. 71-76 [doi]
• Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless NetworksLuís Gouveia, Pedro Moura, Amaro de Sousa. 77-82 [doi]
• Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of LeavesLuís Gouveia, João Telhada. 83-91 [doi]
• A Polyhedral Approach for Solving Two Facility Network Design ProblemFaiz Hamid, Yogesh K. Agarwal. 92-97 [doi]
• FTTH Network Design under OA&M ConstraintsMatthieu Chardy, Cedric Hervet. 98-104 [doi]
• Introducing the Virtual Network Mapping Problem with Delay, Routing and Location ConstraintsJohannes Inführ, Günther R. Raidl. 105-117 [doi]
• Cutset Inequalities for Robust Network DesignArie M. C. A. Koster, Manuel Kutschka, Christian Raack. 118-123 [doi]
• Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree ProblemMarkus Leitner, Mario Ruthmair, Günther R. Raidl. 124-138 [doi]
• A Heuristic Algorithm for a Prize-Collecting Local Access Network Design ProblemIvana Ljubic, Peter Putz, Juan José Salazar González. 139-144 [doi]
• The Two Layer Network Design ProblemSara Mattia. 145-149 [doi]
• Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic RoutingMichael Poss, Christian Raack. 150-155 [doi]
• On the Weight-Constrained Minimum Spanning Tree ProblemAgostinho Agra, Adelaide Cerveira, Cristina Requejo, Eulália Santos. 156-161 [doi]
• The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut AlgorithmLuidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena. 162-169 [doi]
• Multilayer Survivable Optical Network DesignSylvie Borne, Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak. 170-175 [doi]
• Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design ProblemAli Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa. 176-181 [doi]
• Maximum Delay Computation under Traffic Matrix Uncertainty and Its Application to Interdomain Path SelectionIsabel Amigo, Sandrine Vaton, Thierry Chonavel, Federico Larroca. 182-195 [doi]
• The Spatially Equitable Multicommodity Capacitated Network Flow ProblemPaolo Dell'Olmo, Antonino Sgalambro. 196-209 [doi]
• Approximating Minimum Cut with Bounded SizeGiulia Galbiati. 210-215 [doi]
• Lexicographical Minimization of Routing Hops in Telecommunication NetworksLuís Gouveia, Pedro Patrício, Amaro de Sousa. 216-229 [doi]
• A Method for Obtaining the Maximum (δ, η)-Balanced Flow in a NetworkWataru Kishimoto. 230-242 [doi]
• Quickest Cluster Flow Problems on Tree NetworksKathrin Leiner, Stefan Ruzika. 243-255 [doi]
• Strong Duality for the Maximum Borel Flow ProblemRonald Koch, Ebrahim Nasrabadi. 256-261 [doi]
• Modeling the Gateway Location Problem for Multicommodity Flow ReroutingMaurizio Bruglieri, Paola Cappanera, Alberto Colorni, Maddalena Nonato. 262-276 [doi]
• Affine Decision Rules for Tractable Approximations to Robust Capacity Planning in TelecommunicationsAdam Ouorou. 277-282 [doi]
• Optimal Download Time in a Cloud-Assisted Peer-to-Peer Video on Demand ServicePablo Rodríguez-Bocca, Claudia Rostagnol. 283-288 [doi]
• The Maximum Flow Problem with Conflict and Forcing ConditionsUlrich Pferschy, Joachim Schauer. 289-294 [doi]
• Algebraic Methods for Stochastic Minimum Cut and Maximum Flow ProblemsKatherine C. Hastings, Douglas R. Shier. 295-308 [doi]
• Reliable and Restricted Quickest Path ProblemsStefan Ruzika, Markus Thiemann. 309-314 [doi]
• Modeling and Optimization of Production and Distribution of Drinking Water at VMWDerek Verleye, El Houssaine Aghezzaf. 315-326 [doi]
• On the Hazmat Transport Network Design ProblemEdoardo Amaldi, Maurizio Bruglieri, Bernard Fortz. 327-338 [doi]
• Complexity of Inverse Shortest Path RoutingMikael Call, Kaj Holmberg. 339-353 [doi]
• The Skill Vehicle Routing ProblemPaola Cappanera, Luís Gouveia, Maria Grazia Scutellà. 354-364 [doi]
• The Biobjective Inventory Routing Problem - Problem Solution and Decision SupportMartin Josef Geiger, Marc Sevaux. 365-378 [doi]
• Problem Transformations for Vehicle Routing and Scheduling in the European UnionAsvin Goel. 379-384 [doi]
• New Models for and Numerical Tests of the Hamiltonian p-Median ProblemStefan Gollowitzer, Dilson Lucas Pereira, Adam Wojciechowski. 385-394 [doi]
• Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu SearchMirko Maischberger, Jean-François Cordeau. 395-400 [doi]
• The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A MatheuristicInmaculada Rodríguez Martín, Juan José Salazar González. 401-405 [doi]
• An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized RoutesM. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte. 406-411 [doi]
• A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-DockingFernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha. 412-425 [doi]
• Impacts of Imprecise Demand Forecasts in Network Capacity Control: An Online AnalysisJörn Schönberger, Herbert Kopfer. 426-438 [doi]
• A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing ProblemNora Touati Moungla, Pietro Belotti, Vincent Jost, Leo Liberti. 439-449 [doi]
• A Matheuristic for the Dial-a-Ride ProblemRoberto Wolfler Calvo, Nora Touati Moungla. 450-463 [doi]
• A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path RoutingEdoardo Amaldi, Antonio Capone, Luca G. Gianoli, Luca Mascetti. 464-477 [doi]
• Designing AC Power Grids Using Integer Linear ProgrammingArie M. C. A. Koster, Stephan Lemkens. 478-483 [doi]
• Energy Saving in Fixed Wireless Broadband NetworksDavid Coudert, Napoleão Nepomuceno, Issam Tahiri. 484-489 [doi]
• MIP Modeling of Incremental Connected Facility LocationAshwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer. 490-502 [doi]
• A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell FormationBoris Goldengorin, Dmitry Krushinsky. 503-516 [doi]
• Cache Location in Tree Networks: Preliminary ResultsPierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin. 517-522 [doi]
• The Multi Terminal q-FlowLoc Problem: A HeuristicStephanie Heller, Horst W. Hamacher. 523-528 [doi]
• Optimal Bandwidth Allocation in Mesh-Based Peer-to-Peer Streaming NetworksMaría Elisa Bertinat, Darío Padula, Franco Robledo Amoza, Pablo Rodríguez-Bocca, Pablo Romero. 529-534 [doi]
• Hub Location Problems with Choice of Different Hub Capacities and Vehicle TypesJulia Sender, Uwe Clausen. 535-546 [doi]
• A Stochastic Optimization Model for Positioning Disaster Response Facilities for Large Scale EmergenciesAnurag Verma, Gary M. Gaukler. 547-552 [doi]
• Efficient Robust Linear Optimization for Large Repositioning ProblemsHaris Gavranovic, Mirsad Buljubasic. 553-558 [doi]
• Robust Supply Vessel PlanningElin E. Halvorsen-Weare, Kjetil Fagerholt. 559-573 [doi]
• A Liner Shipping Network Design - Routing and Scheduling Impacted by Environmental InfluencesVolker Windeck, Hartmut Stadtler. 574-576 [doi]
• A VND-ILS Heuristic to Solve the RWA ProblemAlexandre Xavier Martins, Christophe Duhamel, Maurício Cardoso de Souza, Rodney Rezende Saldanha, Philippe Mahey. 577-582 [doi]
• Recoverable Robust Knapsacks: Γ-ScenariosChristina Büsing, Arie M. C. A. Koster, Manuel Kutschka. 583-588 [doi]
• A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set ProblemFrancesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato. 589-602 [doi]
• Cuts, c-Cuts, and c-Complexes over the n-CubeM. Reza Emamy-Khansary. 603-606 [doi]
• Exact and Metaheuristic Approaches to Extend Lifetime and Maintain Connectivity in Wireless Sensors NetworksAndrea Raiconi, Monica Gentili. 607-619 [doi]
• Computing Upper Bounds for a LBPP with and without Probabilistic ConstraintsHugo Rodríguez, Pablo Adasme, Abdel Lisser, Ismael Soto. 620-625 [doi]
• Mixed Integer Programming Model for Pricing in TelecommunicationMustapha Bouhtou, Jean-Robin Medori, Michel Minoux. 626-630 [doi]
• UL RSSI as a Design Consideration for Distributed Antenna Systems, Using a Radial Basis Function Model for UL RSSISarel F. Roets, Praven Reddy, Poovendren Govender. 631-642 [doi]
• Handling Rest Requirements and Preassigned Activities in Airline Crew Pairing OptimizationMichael Römer, Taïeb Mellouli. 643-656 [doi]
• On the Cover Scheduling Problem in Wireless Sensor NetworksAndré Rossi, Marc Sevaux, Alok Singh, Martin Josef Geiger. 657-668 [doi]