Network design with probabilistic capacities

@article{Atamtrk2018NetworkDW,
  title={Network design with probabilistic capacities},
  author={Alper Atamt{\"u}rk and Avinash Bhardwaj},
  journal={Networks},
  year={2018},
  volume={71},
  pages={16-30}
}
We consider a network design problem with random arc capacities and give a formulation with a probabilistic capacity constraint on each cut of the network. To handle the exponentially-many probabilistic constraints a separation procedure that solves a nonlinear minimum cut problem is introduced. For the case with independent arc capacities, we exploit the supermodularity of the set function defining the constraints and generate cutting planes based on the supermodular covering knapsack polytope… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 52 references

Submodular functions

  • J. Edmonds
  • matroids, and certain polyhedra,” Combinatorial…
  • 2003
Highly Influential
4 Excerpts

Network and discrete location: Models

  • M. Daskin
  • algorithms and applications, 2nd edition, Wiley…
  • 2013
2 Excerpts

Similar Papers

Loading similar papers…