𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The stochastic bottleneck linear programming problem

✍ Scribed by I. M. Stancu-Minasian; R. Caballero; E. Cerdá; M. M. Muñoz


Book ID
110557516
Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
813 KB
Volume
7
Category
Article
ISSN
1134-5764

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Bottleneck linear programming
✍ Robert S. Garfinkel; Mendu Rao 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 359 KB
Stochastic bottleneck spanning tree prob
✍ Hiroaki Ishii; Toshio Nishida 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

This paper considers a stochastic version of bottleneck spanning tree problem in which edge costs are random variables. The problem is to find an optimal spanning tree under the chance constraint with respect to bottleneck (maximum cost) edge of spanning tree. The problem is first transformed into a