✦ LIBER ✦

On discrete search problems

✍ Scribed by S. S. Kislitsyn

Book ID: 105058481
Publisher: Springer US
Year: 1968
Tongue: English
Weight: 670 KB
Volume: 2
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071410

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Discrete Search Problem on Three Ar

On a Discrete Search Problem on Three Arcs

✍ Bostock, F. A. 📂 Article 📅 1984 🏛 Society for Industrial and Applied Mathematics ⚖ 668 KB

Adaptive search in discrete limit analys

Adaptive search in discrete limit analysis problems

✍ R.J. Fishwick; X.L. Liu; D.W. Begg 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 683 KB

The limit analysis of a segmental arch is considered. A collapse work rate minimisation problem is formulated, with constraints on the minimisation that incorporate a mesh description of geometric compatibility based on KirchhoÕs network laws. A single quadratic objective function and a set of linea

Local search metaheuristics for discrete

Local search metaheuristics for discrete–continuous scheduling problems

✍ Joanna Józefowska; Marek Mika; Rafal Różycki; Grzegorz Waligóra; Jan Węglarz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Discrete search problem in pattern recog

Discrete search problem in pattern recognition (Corresp.)

✍ Saaty, T. 📂 Article 📅 1966 🏛 IEEE 🌐 English ⚖ 351 KB

Use of random search in solving discrete

Use of random search in solving discrete extremal problems

✍ V. G. Ustyuzhaninov 📂 Article 📅 1983 🏛 Springer US 🌐 English ⚖ 857 KB

Search problems on graphs

✍ M. Aigner 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 609 KB