Sample Average Approximation (SAA)

Relay-Hub Network Design for Consolidation Planning Under Demand Variability

  • Onkar Anand Kulkarni
  • Mathieu Dahan
    • Categories Branch and Cut Algorithms, Supply Chain Management, Transportation Tags , , , , , ,

    Problem description: We study the problem of designing large-scale resilient relay logistics hub networks. We propose a model of Capacitated Relay Network Design under Stochastic Demand and Consolidation-Based Routing (CRND-SDCR), which aims to improve a network’s efficiency and resilience against commodity demand variability through integrating tactical decisions. Methodology: We formulate CRND-SDCR as a two-stage stochastic … Read more

    Finding Groups with Maximum Betweenness Centrality via Integer Programming with Random Path Sampling

  • Tomas Lagos
  • Oleg A. Prokopyev
  • Alexander Veremyev
    • Categories Approximation Algorithms, Graphs and Matroids, Stochastic Approaches Tags , , , ,

    One popular approach to access the importance/influence of a group of nodes in a network is based on the notion of centrality. For a given group, its group betweenness centrality is computed, first, by evaluating a ratio of shortest paths between each node pair in a network that are “covered” by at least one node … Read more