✦ LIBER ✦

Local algorithms for block-tree problems of discrete programming

✍ Scribed by O.A. Shcherbina

Publisher: Elsevier Science
Year: 1985
Weight: 624 KB
Volume: 25
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(85)90154-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A modified local algorithm for solving b

A modified local algorithm for solving block problems of discrete programming

✍ O.A. Shcherbina 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 582 KB

On a modified local algorithm for proble

On a modified local algorithm for problems of discrete programming

✍ N.N. Kanayeva; O.A. Shcherbina 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 728 KB

An algorithm for the discrete bilevel pr

An algorithm for the discrete bilevel programming problem

✍ Jonathan F. Bard; James T. Moore 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 915 KB

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting

Asymptotic estimates of the efficiency o

Asymptotic estimates of the efficiency of local algorithms in discrete programming

✍ O.A. Shcherbina 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 450 KB

A new algorithm for solving the discrete

A new algorithm for solving the discrete programming problem

✍ Nguen Ngok Tyu; N.V. Chernikova 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 436 KB

An interval programming algorithm for di

An interval programming algorithm for discrete linear L1 approximation problems

✍ P.D Robers; A Ben-Israel 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 614 KB