✦ LIBER ✦

Computational experience with advanced implementation of decomposition algorithms for linear programming

✍ Scribed by J. K. Ho; E. Loute

Book ID: 110573005
Publisher: Springer-Verlag
Year: 1983
Tongue: English
Weight: 355 KB
Volume: 27
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf02591904

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An advanced implementation of the Dantzi

An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming

✍ James K. Ho; Etienne Loute 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 997 KB

Convergence behavior of decomposition al

Convergence behavior of decomposition algorithms for linear programs

✍ James K. Ho 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 246 KB

Computational experience with a globally

Computational experience with a globally convergent primal—dual predictor—corrector algorithm for linear programming

✍ Irvin J. Lustig; Roy E. Marsten; David F. Shanno 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 764 KB

Computational experience using an edge s

Computational experience using an edge search algorithm for linear reverse convex programs

✍ Stephen E. Jacobsen; Khosrow Moshirvaziri 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 831 KB

This paper presents computational experience with a rather straight forward implementation of an edge search algorithm for obtaining the globally optimal solution for linear programs with an additional reverse convex constraint. The paper's purpose is to provide a collection of problems, with known

Computational experience with a dual aff

Computational experience with a dual affine variant of Karmarkar's method for linear programming

✍ Clyde L. Monma; Andrew J. Morton 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 755 KB

Computational experience with an algorit

Computational experience with an algorithm for 0–1 integer programming

✍ Anil B. Jambekar; David I. Steinberg 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 749 KB