✦ LIBER ✦

Two general methods for dynamizing decomposable searching problems

✍ Scribed by M. H. Overmars; J. Leeuwen

Book ID: 105508893
Publisher: Springer Vienna
Year: 1981
Tongue: English
Weight: 666 KB
Volume: 26
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02241781

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some principles for dynamizing decomposa

Some principles for dynamizing decomposable searching problems

✍ Mark H. Overmars; Jan van Leeuwen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 752 KB

Dynamization of decomposable searching p

Dynamization of decomposable searching problems

✍ Jan Van Leeuwen; Derick Wood 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 730 KB

Worst-case optimal insertion and deletio

Worst-case optimal insertion and deletion methods for decomposable searching problems

✍ Mark H. Overmars; Jan van Leeuwen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 886 KB

Optimal dynamization of decomposable sea

Optimal dynamization of decomposable searching problems

✍ Kurt Mehlhorn; Mark H. Overmars 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 712 KB

Two general methods for computing saddle

Two general methods for computing saddle points with applications for decomposing convex programming problems

✍ A. Auslender 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 818 KB

Two general methods for inverse optimiza

Two general methods for inverse optimization problems

✍ C. Yang; J. Zhang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 240 KB

We formulate a group of inverse optimization problems as a uniform LP model and provide two computation methods. One is a column generation method which generates necessary columns for simplex method by solving the original optimization problem. Another is an application of the ellipsoid method whic