✦ LIBER ✦

D-optimal designs with minimal and nearly minimal number of units

✍ Scribed by K. Balasubramanian; Aloke Dey

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 338 KB
Volume: 52
Category: Article
ISSN: 0378-3758
DOI: 10.1016/0378-3758(95)00117-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal block designs with minimal numbe

Optimal block designs with minimal number of observations

✍ R.B. Bapat; A. Dey 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Minimal number of support points for min

Minimal number of support points for mini-max optimal designs

✍ Weng Kee Wong 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Determining minimal cuts with a minimal

Determining minimal cuts with a minimal number of arcs

✍ Horst Hamacher 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 478 KB

Optimal ordering policies and optimal nu

Optimal ordering policies and optimal number of minimal repairs before replacement

✍ Shey-Huei Sheu; Ching-Tien Liou; Bee-Ching Tseng 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Optimal number of minimal repairs before

Optimal number of minimal repairs before replacement with repair cost limit

✍ P.K. Kapur; R.B. Garg 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Saturated graphs with minimal number of

Saturated graphs with minimal number of edges

✍ L. Kászonyi; Zs. Tuza 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

Let F = {F,, . . .} be a given class of forbidden graphs. A graph G is called F-saturated if no F, E F is a subgraph of G but the addition of an arbitrary new edge gives a forbidden subgraph. In this paper the minimal number of edges in F-saturated graphs is examined. General estimations are given a