Atjaunināt sīkdatņu piekrišanu

E-grāmata: Network Optimization: 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011, Proceedings

Edited by , Edited by , Edited by
  • Formāts - PDF+DRM
  • Cena: 106,47 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

This book constitutes the refereed proceedings of the 5th International Conference on Network Optimization, INOC 2011, held in Hamburg, Germany, in June 2011. The 65 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers highlight recent developments in network optimization and are organized in the following topical sections: theoretical problems, uncertainty, graph theory and network design; network flows; routing and transportation; and further optimization problems and applications (energy oriented network design, telecom applications, location, maritime shipping, and graph theory).
Part I Theoretical Problems / Uncertainty / Graph Theory / Network Design
On the Design of Optical OFDM-Based Networks
1(6)
Amal Benhamiche
Ridha Mahjoub
Nancy Perrot
An Exact Algorithm for Robust Network Design
7(11)
Christoph Buchheim
Frauke Liers
Laura Sanita
SRG-Disjoint Design with Dedicated and Shared Protection
18(6)
Bernardetta Addis
Giuliana Carello
Federico Malucelli
Improved Formulations for the Ring Spur Assignment Problem
24(13)
Paula Carroll
Bernard Fortz
Martine Labbe
Sean McGarraghy
A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks
37(6)
Grit Claßen
David Coudert
Arie M.C.A. Koster
Napoleao Nepomuceno
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem
43(8)
Alexandre Salles da Cunha
Luidi Simonetti
Abilio Lucena
Negative Cycle Separation in Wireless Network Design
51(6)
Fabio D'Andreagiovanni
Carlo Mannino
Antonio Sassano
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
57(14)
Stefan Gollowitzer
Luis Gouveia
Ivana Ljubic
The Two Level Network Design Problem with Secondary Hop Constraints
71(6)
Stefan Gollowitzer
Luis Gouveia
Ivana Ljubic
Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks
77(6)
Luis Gouveia
Pedro Moura
Amaro de Sousa
Reformulation by Intersection Method on the MST Problem With Lower Bound on the Number of Leaves
83(9)
Luis Gouveia
Joao Telhada
A Polyhedral Approach for Solving Two Facility Network Design Problem
92(6)
Faiz Hamid
Yogesh K. Agarwal
FTTH Network Design under OA&M Constraints
98(7)
Matthieu Chardy
Cedric Hervet
Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints
105(13)
Johannes Infuhr
Gunther R. Raidl
Cutset Inequalities for Robust Network Design
118(6)
Arie M.C.A. Koster
Manuel Kutschka
Christian Raack
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
124(15)
Markus Leitner
Mario Ruthmair
Gunther R. Raidl
A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem
139(6)
Ivana Ljubic
Peter Putz
Juan-Jose Salazar-Gonzalez
The Two Layer Network Design Problem
145(5)
Sara Mattia
Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
150(6)
Michael Poss
Christian Raack
On the Weight-Constrained Minimum Spanning Tree Problem
156(6)
Agostinho Agra
Adelaide Cerveira
Cristina Requejo
Eulalia Santos
The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
162(8)
Luidi Simonetti
Alexandre Salles da Cunha
Abilio Lucena
Multilayer Survivable Optical Network Design
170(6)
Sylvie Borne
Virginie Gabrel
Ridha Mahjoub
Raouia Taktak
Hop-Level Flow Formulation for the Hop constrained Survivable Network Design Problem
176(6)
Ridha Mahjoub
Luidi Simonetti
Eduardo Uchoa
Part II Network Flow
Maximum Delay Computation under Traffic Matrix Uncertainty and Its Application to Interdomain Path Selection
182(14)
Isabel Amigo
Sandrine Vaton
Thierry Chonavel
Federico Larroca
The Spatially Equitable Multicommodity Capacitated Network Flow Problem
196(14)
Paolo Dell'Olmo
Antonino Sgalambro
Approximating Minimum Cut with Bounded Size
210(6)
Giulia Galbiati
Lexicographical Minimization of Routing Hops in Telecommunication Networks
216(14)
Luis Gouveia
Pedro Patricio
Amaro de Sousa
A Method for Obtaining the Maximum (δ, η)-Balanced Flow in a Network
230(13)
Wataru Kishimoto
Quickest Cluster Flow Problems on Tree Networks
243(13)
Kathrin Leiner
Stefan Ruzika
Strong Duality for the Maximum Borel Flow Problem
256(6)
Ronald Koch
Ebrahim Nasrabadi
Modeling the Gateway Location Problem for Multicommodity Flow Rerouting
262(15)
Maurizio Bruglieri
Paola Cappanera
Alberto Colorni
Maddalena Nonato
Affine Decision Rules for Tractable Approximations to Robust Capacity Planning in Telecommunications
277(6)
Adam Ouorou
Optimal Download Time in a Cloud-Assisted Peer-to-Peer Video on Demand Service
283(6)
Pablo Rodriguez-Bocca
Claudia Rostagnol
The Maximum Flow Problem with Conflict and Forcing Conditions
289(6)
Ulrich Pferschy
Joachim Schauer
Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems
295(14)
Katherine C. Hastings
Douglas R. Shier
Reliable and Restricted Quickest Path Problems
309(6)
Stefan Ruzika
Markus Thiemann
Modeling and Optimization of Production and Distribution of Drinking Water at VMW
315(12)
Derek Verleye
El-Houssaine Aghezzaf
Part III Routing and Transportation
On the Hazmat Transport Network Design Problem
327(12)
Edoardo Amaldi
Maurizio Bruglieri
Bernard Fortz
Complexity of Inverse Shortest Path Routing
339(15)
Mikael Call
Kaj Holmberg
The Skill Vehicle Routing Problem
354(11)
Paola Cappanera
Luis Gouveia
Maria Grazia Scutella
The Biobjective Inventory Routing Problem -- Problem Solution and Decision Support
365(14)
Martin Josef Geiger
Mare Sevaux
Problem Transformations for Vehicle Routing and Scheduling in the European Union
379(6)
Asvin Goel
New Models for and Numerical Tests of the Hamiltonian p-Median Problem
385(10)
Stefan Gollowitzer
Dilson Lucas Pereira
Adam Wojciechowski
Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search
395(6)
Mirko Maischberger
Jean-Prangois Cordeau
The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic
401(5)
I. Rodriguez-Martin
Juan Jose Salazar-Gonzalez
An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes
406(6)
M. Angelica Salazar-Aguilar
Andre Langevin
Gilbert Laporte
A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking
412(14)
Fernando Afonso Santos
Geraldo Robson Mateus
Alexandre Salles da Cunha
Impacts of Imprecise Demand Forecasts in Network Capacity Control: An Online Analysis
426(13)
Jorn Schonberger
Herbert Kopfer
A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
439(11)
Nora Touati-Moungla
Pietro Belotti
Vincent Jost
Leo Liberti
A Matheuristic for the Dial-a-Ride Problem
450(14)
Roberto Wolfler Calvo
Nora Touati-Moungla
Part IV Further Optimization Problems and Applications
A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing
464(14)
Edoardo Amaldi
Antonio Capone
Luca G. Gianoli
Luca Mascetti
Designing AC Power Grids Using Integer Linear Programming
478(6)
Arie M.C.A. Koster
Stephan Lemkens
Energy Saving in Fixed Wireless Broadband Networks
484(6)
David Coudert
Napoleao Nepomuceno
Issam Tahiri
MIP Modeling of Incremental Connected Facility Location
490(13)
Ashwin Arulselvan
Andreas Bley
Stefan Gollowitzer
Ivana Ljubic
Olaf Maurer
A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation
503(14)
Boris Goldengorin
Dmitry Krushinsky
Cache Location in Tree Networks: Preliminary Results
517(6)
Bauguion Pierre
Ben Ameur Walid
Gourdin Eric
The Multi Terminal q-FlowLoc Problem: A Heuristic
523(6)
Stephanie Heller
Horst W. Hamacher
Optimal Bandwidth Allocation in Mesh-Based Peer-to-Peer Streaming Networks
529(6)
Maria Elisa Bertinat
Dario Padula
Franco Robledo Amoza
Pablo Rodriguez-Bocea
Pablo Romero
Hub Location Problems with Choice of Different Hub Capacities and Vehicle Types
535(12)
Julia Sender
Uwe Clausen
A Stochastic Optimization Model for Positioning Disaster Response Facilities for Large Scale Emergencies
547(6)
Anurag Verma
Gary M. Gaukler
Efficient Robust Linear Optimization for Large Repositioning Problems
553(6)
Haris Gavranovic
Mirsad Buljubasic
Robust Supply Vessel Planning
559(15)
Elin E. Halvorsen-Weare
Kjetil Fagerholt
A Liner Shipping Network Design -- Routing and Scheduling Impacted by Environmental Influences
574(3)
Volker Windeck
Hartmut Stadtler
A VND-ILS Heuristic to Solve the RWA Problem
577(6)
Alexandre Xavier Martins
Christophe Duhamel
Mauricio Cardoso de Souza
Rodney Rezende Saldanha
Philippe Mahey
Recoverable Robust Knapsacks: Γ-Scenarios
583(6)
Christina Busing
Arie M.C.A. Koster
Manuel Kutschka
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem
589(14)
Francesco Carrabs
Raffaele Cerulli
Monica Gentili
Gennaro Parlato
Cuts, c-Cuts, and c-Complexes over the n-Cube
603(4)
M. Reza Emamy-Khansary
Exact and Metaheuristic Approaches to Extend Lifetime and Maintain Connectivity in Wireless Sensors Networks
607(13)
Andrea Raiconi
Monica Gentili
Computing Upper Bounds for a LBPP With and Without Probabilistic Constraints
620(6)
Hugo Rodriguez
Pablo Adasme
Abdel Lisser
Ismael Soto
Mixed Integer Programming Model for Pricing in Telecommunication
626(5)
Mustapha Bouhtou
Jean-Robin Medori
Michel Minoux
UL RSSI as a Design Consideration for Distributed Antenna Systems, Using a Radial Basis Function Model for UL RSSI
631(12)
Sarel Roets
Praven Reddy
Poovendren Govender
Handling Rest Requirements and Preassigned Activities in Airline Crew Pairing Optimization
643(14)
Michael Romer
Taieb Mellouli
On the Cover Scheduling Problem in Wireless Sensor Networks
657(12)
Andre Rossi
Marc Sevaux
Alok Singh
Martin Josef Geiger
Author Index 669