𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minmax combinatorial optimization

✍ Scribed by Abraham P. Punnen; Y.P. Aneja


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
638 KB
Volume
81
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Interval data minmax regret network opti
✍ Igor Averbakh; Vasilij Lebedev πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 312 KB

We consider the minimum spanning tree and the shortest path problems on a network with uncertain lengths of edges. In particular, for any edge of the network, only an interval estimate of the length of the edge is known, and it is assumed that the length of each edge can take on any value from the c

Convex Combinatorial Optimization
✍ Shmuel Onn; Uriel G. Rothblum πŸ“‚ Article πŸ“… 2004 πŸ› Springer 🌐 English βš– 222 KB