✦ LIBER ✦

Modifications and implementation of the ellipsoid algorithm for linear programming

✍ Scribed by Donald Goldfarb; Michael J. Todd

Publisher: Springer-Verlag
Year: 1982
Tongue: English
Weight: 1011 KB
Volume: 23
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01583776

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

Application of the ellipsoid method in a

Application of the ellipsoid method in an interactive procedure for multicriteria linear programming

✍ R. Slowiński; J. Warczyński 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 570 KB

The decomposition principle and algorith

The decomposition principle and algorithms for linear programming

✍ K. Kim; J.L. Nazareth 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 788 KB

Extensions of the potential reduction al

Extensions of the potential reduction algorithm for linear programming

✍ Y. Y. Ye 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 628 KB

A program which implements a new algorit

A program which implements a new algorithm for the solution of the linear minimax approximation problem

✍ N. Papamarkos 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 910 KB

A parallel branch-and-bound algorithm fo

A parallel branch-and-bound algorithm for integer linear programming and its implementation on a distributed multiprocessor

✍ Atsuko Ikegami; Katsuhiro Aoyagi; Hajime Iizuka 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 830 KB

## Abstract This paper describes a parallel branch‐and‐bound algorithm for general integer linear programming problems and its implementation on a distributed memory multiprocessor nCUBE2. With a branch‐and‐bound algorithm, the amount of computation on each search tree node varies, and in general,