↓ Skip to main content

Network Optimization

Overview of attention for book
Cover of 'Network Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On the Design of Optical OFDM-Based Networks
  3. Altmetric Badge
    Chapter 2 An Exact Algorithm for Robust Network Design
  4. Altmetric Badge
    Chapter 3 SRG-Disjoint Design with Dedicated and Shared Protection
  5. Altmetric Badge
    Chapter 4 Network Optimization
  6. Altmetric Badge
    Chapter 5 A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks
  7. Altmetric Badge
    Chapter 6 Formulations and Branch-and-Cut Algorithm for the K -rooted Mini-Max Spanning Forest Problem
  8. Altmetric Badge
    Chapter 7 Negative Cycle Separation in Wireless Network Design
  9. Altmetric Badge
    Chapter 8 A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
  10. Altmetric Badge
    Chapter 9 The Two Level Network Design Problem with Secondary Hop Constraints
  11. Altmetric Badge
    Chapter 10 Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks
  12. Altmetric Badge
    Chapter 11 Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves
  13. Altmetric Badge
    Chapter 12 A Polyhedral Approach for Solving Two Facility Network Design Problem
  14. Altmetric Badge
    Chapter 13 FTTH Network Design under OA&M Constraints
  15. Altmetric Badge
    Chapter 14 Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints
  16. Altmetric Badge
    Chapter 15 Cutset Inequalities for Robust Network Design
  17. Altmetric Badge
    Chapter 16 Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
  18. Altmetric Badge
    Chapter 17 A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem
  19. Altmetric Badge
    Chapter 18 The Two Layer Network Design Problem
  20. Altmetric Badge
    Chapter 19 Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
  21. Altmetric Badge
    Chapter 20 On the Weight-Constrained Minimum Spanning Tree Problem
  22. Altmetric Badge
    Chapter 21 The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
  23. Altmetric Badge
    Chapter 22 Multilayer Survivable Optical Network Design
  24. Altmetric Badge
    Chapter 23 Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem
  25. Altmetric Badge
    Chapter 24 Maximum Delay Computation under Traffic Matrix Uncertainty and Its Application to Interdomain Path Selection
  26. Altmetric Badge
    Chapter 25 The Spatially Equitable Multicommodity Capacitated Network Flow Problem
  27. Altmetric Badge
    Chapter 26 Approximating Minimum Cut with Bounded Size
  28. Altmetric Badge
    Chapter 27 Lexicographical Minimization of Routing Hops in Telecommunication Networks
  29. Altmetric Badge
    Chapter 28 A Method for Obtaining the Maximum ( δ , η )-Balanced Flow in a Network
  30. Altmetric Badge
    Chapter 29 Quickest Cluster Flow Problems on Tree Networks
  31. Altmetric Badge
    Chapter 30 Strong Duality for the Maximum Borel Flow Problem
  32. Altmetric Badge
    Chapter 31 Modeling the Gateway Location Problem for Multicommodity Flow Rerouting
  33. Altmetric Badge
    Chapter 32 Affine Decision Rules for Tractable Approximations to Robust Capacity Planning in Telecommunications
  34. Altmetric Badge
    Chapter 33 Optimal Download Time in a Cloud-Assisted Peer-to-Peer Video on Demand Service
  35. Altmetric Badge
    Chapter 34 The Maximum Flow Problem with Conflict and Forcing Conditions
  36. Altmetric Badge
    Chapter 35 Algebraic Methods for Stochastic Minimum Cut and Maximum Flow Problems
  37. Altmetric Badge
    Chapter 36 Reliable and Restricted Quickest Path Problems
  38. Altmetric Badge
    Chapter 37 Modeling and Optimization of Production and Distribution of Drinking Water at VMW
  39. Altmetric Badge
    Chapter 38 On the Hazmat Transport Network Design Problem
  40. Altmetric Badge
    Chapter 39 Complexity of Inverse Shortest Path Routing
  41. Altmetric Badge
    Chapter 40 The Skill Vehicle Routing Problem
  42. Altmetric Badge
    Chapter 41 The Biobjective Inventory Routing Problem – Problem Solution and Decision Support
  43. Altmetric Badge
    Chapter 42 Problem Transformations for Vehicle Routing and Scheduling in the European Union
  44. Altmetric Badge
    Chapter 43 New Models for and Numerical Tests of the Hamiltonian p -Median Problem
  45. Altmetric Badge
    Chapter 44 Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search
  46. Altmetric Badge
    Chapter 45 The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic
  47. Altmetric Badge
    Chapter 46 An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes
  48. Altmetric Badge
    Chapter 47 A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking
  49. Altmetric Badge
    Chapter 48 Impacts of Imprecise Demand Forecasts in Network Capacity Control: An Online Analysis
  50. Altmetric Badge
    Chapter 49 A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
  51. Altmetric Badge
    Chapter 50 A Matheuristic for the Dial-a-Ride Problem
  52. Altmetric Badge
    Chapter 51 A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing
  53. Altmetric Badge
    Chapter 52 Designing AC Power Grids Using Integer Linear Programming
  54. Altmetric Badge
    Chapter 53 Energy Saving in Fixed Wireless Broadband Networks
  55. Altmetric Badge
    Chapter 54 MIP Modeling of Incremental Connected Facility Location
  56. Altmetric Badge
    Chapter 55 A Computational Study of the Pseudo-Boolean Approach to the p -Median Problem Applied to Cell Formation
  57. Altmetric Badge
    Chapter 56 Cache Location in Tree Networks: Preliminary Results
  58. Altmetric Badge
    Chapter 57 The Multi Terminal q -FlowLoc Problem: A Heuristic
  59. Altmetric Badge
    Chapter 58 Optimal Bandwidth Allocation in Mesh-Based Peer-to-Peer Streaming Networks
  60. Altmetric Badge
    Chapter 59 Hub Location Problems with Choice of Different Hub Capacities and Vehicle Types
  61. Altmetric Badge
    Chapter 60 A Stochastic Optimization Model for Positioning Disaster Response Facilities for Large Scale Emergencies
  62. Altmetric Badge
    Chapter 61 Efficient Robust Linear Optimization for Large Repositioning Problems
  63. Altmetric Badge
    Chapter 62 Robust Supply Vessel Planning
  64. Altmetric Badge
    Chapter 63 A Liner Shipping Network Design – Routing and Scheduling Impacted by Environmental Influences
  65. Altmetric Badge
    Chapter 64 A VND-ILS Heuristic to Solve the RWA Problem
  66. Altmetric Badge
    Chapter 65 Recoverable Robust Knapsacks: Γ-Scenarios
  67. Altmetric Badge
    Chapter 66 A Tabu Search Heuristic Based on k -Diamonds for the Weighted Feedback Vertex Set Problem
  68. Altmetric Badge
    Chapter 67 Cuts, c-Cuts, and c-Complexes over the n -Cube
  69. Altmetric Badge
    Chapter 68 Exact and Metaheuristic Approaches to Extend Lifetime and Maintain Connectivity in Wireless Sensors Networks
  70. Altmetric Badge
    Chapter 69 Computing Upper Bounds for a LBPP with and without Probabilistic Constraints
  71. Altmetric Badge
    Chapter 70 Mixed Integer Programming Model for Pricing in Telecommunication
  72. Altmetric Badge
    Chapter 71 UL RSSI as a Design Consideration for Distributed Antenna Systems, Using a Radial Basis Function Model for UL RSSI
  73. Altmetric Badge
    Chapter 72 Handling Rest Requirements and Preassigned Activities in Airline Crew Pairing Optimization
  74. Altmetric Badge
    Chapter 73 On the Cover Scheduling Problem in Wireless Sensor Networks
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age and source (55th percentile)

Mentioned by

twitter
5 X users

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
15 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Network Optimization
Published by
Lecture notes in computer science, January 2011
DOI 10.1007/978-3-642-21527-8
ISBNs
978-3-64-221526-1, 978-3-64-221527-8
Authors

Julia Pahl, Torsten Reiners, Stefan Voß

Editors

Pahl, Julia, Reiners, Torsten, Voß, Stefan, Pahl, Julia, Reiners, Torsten, Voß, Stefan

X Demographics

X Demographics

The data shown below were collected from the profiles of 5 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 15 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 15 100%

Demographic breakdown

Readers by professional status Count As %
Unspecified 1 7%
Researcher 1 7%
Student > Master 1 7%
Unknown 12 80%
Readers by discipline Count As %
Engineering 2 13%
Unspecified 1 7%
Unknown 12 80%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 2. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 18 April 2017.
All research outputs
#14,909,825
of 23,852,579 outputs
Outputs from Lecture notes in computer science
#4,344
of 8,162 outputs
Outputs of similar age
#141,322
of 185,317 outputs
Outputs of similar age from Lecture notes in computer science
#137
of 317 outputs
Altmetric has tracked 23,852,579 research outputs across all sources so far. This one is in the 35th percentile – i.e., 35% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,162 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.1. This one is in the 44th percentile – i.e., 44% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 185,317 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 22nd percentile – i.e., 22% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 317 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 55% of its contemporaries.