INOC 2011:
Hamburg, Germany
Julia Pahl, Torsten Reiners, Stefan Voß (Eds.):
Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings.
Lecture Notes in Computer Science 6701 Springer 2011, ISBN 978-3-642-21526-1
Theoretical Problems / Uncertainty / Graph Theory / Network Design
- Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot:
On the Design of Optical OFDM-Based Networks.
1-6

- Christoph Buchheim, Frauke Liers, Laura Sanità:
An Exact Algorithm for Robust Network Design.
7-17

- Bernardetta Addis, Giuliana Carello, Federico Malucelli:
SRG-Disjoint Design with Dedicated and Shared Protection.
18-23

- Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy:
Improved Formulations for the Ring Spur Assignment Problem.
24-36

- Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno:
A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks.
37-42

- Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena:
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem.
43-50

- Fabio D'Andreagiovanni, Carlo Mannino, Antonio Sassano:
Negative Cycle Separation in Wireless Network Design.
51-56

- Stefan Gollowitzer, Luis Gouveia, Ivana Ljubic:
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes.
57-70

- Stefan Gollowitzer, Luís Gouveia, Ivana Ljubic:
The Two Level Network Design Problem with Secondary Hop Constraints.
71-76

- Luís Gouveia, Pedro Moura, Amaro de Sousa:
Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks.
77-82

- Luís Gouveia, João Telhada:
Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves.
83-91

- Faiz Hamid, Yogesh K. Agarwal:
A Polyhedral Approach for Solving Two Facility Network Design Problem.
92-97

- Matthieu Chardy, Cedric Hervet:
FTTH Network Design under OA&M Constraints.
98-104

- Johannes Inführ, Günther R. Raidl:
Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints.
105-117

- Arie M. C. A. Koster, Manuel Kutschka, Christian Raack:
Cutset Inequalities for Robust Network Design.
118-123

- Markus Leitner, Mario Ruthmair, Günther R. Raidl:
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem.
124-138

- Ivana Ljubic, Peter Putz, Juan José Salazar González:
A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem.
139-144

- Sara Mattia:
The Two Layer Network Design Problem.
145-149

- Michael Poss, Christian Raack:
Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing.
150-155

- Agostinho Agra, Adelaide Cerveira, Cristina Requejo, Eulália Santos:
On the Weight-Constrained Minimum Spanning Tree Problem.
156-161

- Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena:
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm.
162-169

- Sylvie Borne, Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak:
Multilayer Survivable Optical Network Design.
170-175

- Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa:
Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem.
176-181

Network Flow
- Isabel Amigo, Sandrine Vaton, Thierry Chonavel, Federico Larroca:
Maximum Delay Computation under Traffic Matrix Uncertainty and Its Application to Interdomain Path Selection.
182-195

- Paolo Dell'Olmo, Antonino Sgalambro:
The Spatially Equitable Multicommodity Capacitated Network Flow Problem.
196-209

- Giulia Galbiati:
Approximating Minimum Cut with Bounded Size.
210-215

- Luís Gouveia, Pedro Patrício, Amaro de Sousa:
Lexicographical Minimization of Routing Hops in Telecommunication Networks.
216-229

- Wataru Kishimoto:
A Method for Obtaining the Maximum (δ, η)-Balanced Flow in a Network.
230-242

- Kathrin Leiner, Stefan Ruzika:
Quickest Cluster Flow Problems on Tree Networks.
243-255

- Ronald Koch, Ebrahim Nasrabadi:
Strong Duality for the Maximum Borel Flow Problem.
256-261

- Maurizio Bruglieri, Paola Cappanera, Alberto Colorni, Maddalena Nonato:
Modeling the Gateway Location Problem for Multicommodity Flow Rerouting.
262-276

- Adam Ouorou:
Affine Decision Rules for Tractable Approximations to Robust Capacity Planning in Telecommunications.
277-282

- Pablo Rodríguez-Bocca, Claudia Rostagnol:
Optimal Download Time in a Cloud-Assisted Peer-to-Peer Video on Demand Service.
283-288

- Ulrich Pferschy, Joachim Schauer:
The Maximum Flow Problem with Conflict and Forcing Conditions.
289-294

- Katherine C. Hastings, Douglas R. Shier:
Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems.
295-308

- Stefan Ruzika, Markus Thiemann:
Reliable and Restricted Quickest Path Problems.
309-314

- Derek Verleye, El Houssaine Aghezzaf:
Modeling and Optimization of Production and Distribution of Drinking Water at VMW.
315-326

Routing and Transportation
- Edoardo Amaldi, Maurizio Bruglieri, Bernard Fortz:
On the Hazmat Transport Network Design Problem.
327-338

- Mikael Call, Kaj Holmberg:
Complexity of Inverse Shortest Path Routing.
339-353

- Paola Cappanera, Luís Gouveia, Maria Grazia Scutellà:
The Skill Vehicle Routing Problem.
354-364

- Martin Josef Geiger, Marc Sevaux:
The Biobjective Inventory Routing Problem - Problem Solution and Decision Support.
365-378

- Asvin Goel:
Problem Transformations for Vehicle Routing and Scheduling in the European Union.
379-384

- Stefan Gollowitzer, Dilson Lucas Pereira, Adam Wojciechowski:
New Models for and Numerical Tests of the Hamiltonian p-Median Problem.
385-394

- Mirko Maischberger, Jean-François Cordeau:
Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search.
395-400

- Inmaculada Rodríguez Martín, Juan José Salazar González:
The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic.
401-405

- M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte:
An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes.
406-411

- Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha:
A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking.
412-425

- Jörn Schönberger, Herbert Kopfer:
Impacts of Imprecise Demand Forecasts in Network Capacity Control: An Online Analysis.
426-438

- Nora Touati Moungla, Pietro Belotti, Vincent Jost, Leo Liberti:
A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem.
439-449

- Roberto Wolfler Calvo, Nora Touati Moungla:
A Matheuristic for the Dial-a-Ride Problem.
450-463

Further Optimization Problems and Applications
- Edoardo Amaldi, Antonio Capone, Luca G. Gianoli, Luca Mascetti:
A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing.
464-477

- Arie M. C. A. Koster, Stephan Lemkens:
Designing AC Power Grids Using Integer Linear Programming.
478-483

- David Coudert, Napoleão Nepomuceno, Issam Tahiri:
Energy Saving in Fixed Wireless Broadband Networks.
484-489

- Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer:
MIP Modeling of Incremental Connected Facility Location.
490-502

- Boris Goldengorin, Dmitry Krushinsky:
A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation.
503-516

- Pierre Bauguion, Walid Ben-Ameur, Éric Gourdin:
Cache Location in Tree Networks: Preliminary Results.
517-522

- Stephanie Heller, Horst W. Hamacher:
The Multi Terminal q-FlowLoc Problem: A Heuristic.
523-528

- María Elisa Bertinat, Darío Padula, Franco Robledo Amoza, Pablo Rodríguez-Bocca, Pablo Romero:
Optimal Bandwidth Allocation in Mesh-Based Peer-to-Peer Streaming Networks.
529-534

- Julia Sender, Uwe Clausen:
Hub Location Problems with Choice of Different Hub Capacities and Vehicle Types.
535-546

- Anurag Verma, Gary M. Gaukler:
A Stochastic Optimization Model for Positioning Disaster Response Facilities for Large Scale Emergencies.
547-552

- Haris Gavranovic, Mirsad Buljubasic:
Efficient Robust Linear Optimization for Large Repositioning Problems.
553-558

- Elin E. Halvorsen-Weare, Kjetil Fagerholt:
Robust Supply Vessel Planning.
559-573

- Volker Windeck, Hartmut Stadtler:
A Liner Shipping Network Design - Routing and Scheduling Impacted by Environmental Influences.
574-576

- Alexandre Xavier Martins, Christophe Duhamel, Maurício Cardoso de Souza, Rodney Rezende Saldanha, Philippe Mahey:
A VND-ILS Heuristic to Solve the RWA Problem.
577-582

- Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka:
Recoverable Robust Knapsacks: Γ-Scenarios.
583-588

- Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem.
589-602

- M. Reza Emamy-Khansary:
Cuts, c-Cuts, and c-Complexes over the n-Cube.
603-606

- Andrea Raiconi, Monica Gentili:
Exact and Metaheuristic Approaches to Extend Lifetime and Maintain Connectivity in Wireless Sensors Networks.
607-619

- Hugo Rodríguez, Pablo Adasme, Abdel Lisser, Ismael Soto:
Computing Upper Bounds for a LBPP with and without Probabilistic Constraints.
620-625

- Mustapha Bouhtou, Jean-Robin Medori, Michel Minoux:
Mixed Integer Programming Model for Pricing in Telecommunication.
626-630

- Sarel F. Roets, Praven Reddy, Poovendren Govender:
UL RSSI as a Design Consideration for Distributed Antenna Systems, Using a Radial Basis Function Model for UL RSSI.
631-642

- Michael Römer, Taïeb Mellouli:
Handling Rest Requirements and Preassigned Activities in Airline Crew Pairing Optimization.
643-656

- André Rossi, Marc Sevaux, Alok Singh, Martin Josef Geiger:
On the Cover Scheduling Problem in Wireless Sensor Networks.
657-668

Last update Mon May 20 23:49:41 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page