✦ LIBER ✦

On a 2-dimensional search problem

✍ Scribed by Miklós Ruszinkó

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 654 KB
Volume: 37
Category: Article
ISSN: 0378-3758
DOI: 10.1016/0378-3758(93)90113-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a 2-dimensional equipartition problem

✍ Francesco Conti; Federico Malucelli; Sara Nicoloso; Bruno Simeone 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 192 KB

The present paper deals with the following problem, which arises in a variety of applications: given a node-weighted rectangular grid graph, perform p horizontal full cuts and q vertical ones so as to make the weights of the resulting p 1q 1 rectangular subgrids ``as close as possible''. Computation

Random search in the one-dimensional cut

Random search in the one-dimensional cutting stock problem

✍ Richard Vahrenkamp 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 578 KB

A ternary search problem on graphs

✍ Thomas Andreae 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 674 KB

A binary search problem on graphs

✍ Reinhard Franzkeit 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 315 KB

On a problem of optimal search

✍ H. W. Gottinger 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 333 KB

A new one dimensional search technique

✍ James W. Gentry 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 421 KB

A new one dimensional search technique for unimodal functions is proposed which is on the average better than the Golden Section Method and is easy to program for machine search. An analysis based on the further assumption that the objective function is symmetric demonstrates the assertions made reg