The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations

@article{Altin2011TheRN,
  title={The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations},
  author={Ayseg{\"u}l Altin and Hande Yaman and Mustafa Ç. Pinar},
  journal={INFORMS Journal on Computing},
  year={2011},
  volume={23},
  pages={75-89}
}
We consider the Network Loading Problem (NLP) under a polyhedral uncertainty description of traffic demands for which we give a compact multi-commodity formulation and state a nice decomposition property obtained from projecting out the flow variables. This property considerably simplifies the resulting polyhedral analysis and computations by doing away with metric inequalities, an attendant feature of the most successful algorithms on NLP. Then we focus on the hose model of demand uncertainty… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS
18 Citations
52 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

References

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

Similar Papers

Loading similar papers…