✦ LIBER ✦

The optimal network problem: Some computational procedures

✍ Scribed by Allen J. Scott

Publisher: Elsevier Science
Year: 1969
Weight: 774 KB
Volume: 3
Category: Article
ISSN: 0041-1647
DOI: 10.1016/0041-1647(69)90152-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The optimal network problem: some comput

The optimal network problem: some computational procedures

📂 Article 📅 1969 🏛 Elsevier Science ⚖ 88 KB

Optimization problems in computer networ

Optimization problems in computer network design

✍ S.I Samoylenko 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 773 KB

Simple stochastic networks: Some problem

Simple stochastic networks: Some problems and procedures

✍ J. M. Burt Jr.; D. P. Gaver; M. Perlas 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 894 KB

An extensive literature now exists describing and solving various problems related to aspects of project graph analysis. Attention is called in particular to the papers of Charnes, Cooper, and Thompson (21, Hartley and Wortham [S], Kelley [7], Martin [9], and Jewel1 [6J, although there are many othe

Solving the optimal network problem

✍ T.B. Boffey; A.I. Hinxman 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 761 KB

Computational procedures for optimal sto

Computational procedures for optimal stopping problems for Markov chains

✍ Harold J Kushner 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 410 KB

Some comments on the optimal assembly pr

Some comments on the optimal assembly problem

✍ Frank K. Hwang; Uriel G. Rothblum 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 830 KB

It is shown that two recent results of Baxter and Harche [ 11 on monotone and balanced optimal assemblies hold only under conditions that are more restrictive than those originally proposed by the authors. We describe such additional conditions, illustrate why they are needed, and establish their su