✦ LIBER ✦

A greedy algorithm for solving a certain class of linear programmes

✍ Scribed by F. D. J. Dunstan; D. J. A. Welsh

Book ID: 105248625
Publisher: Springer-Verlag
Year: 1973
Tongue: English
Weight: 518 KB
Volume: 5
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01580137

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Numerical algorithm for solving sesquili

Numerical algorithm for solving sesquilinear matrix equations of a certain class

✍ Vorontsov, Yu. O.; Ikramov, Kh. D. 📂 Article 📅 2014 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 177 KB

AnO(nlogn)-algorithm for solving a speci

AnO(nlogn)-algorithm for solving a special class of linear programs

✍ W. Bein; P. Brucker 📂 Article 📅 1989 🏛 Springer Vienna 🌐 English ⚖ 230 KB

An algorithm for solving a structured cl

An algorithm for solving a structured class of linear programming problems

✍ S.Selcuk Erenguc 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 452 KB

B-differentiable Algorithm for Solving a

B-differentiable Algorithm for Solving a Class of Linear Complementarity Problems

✍ Shan Haiyan 📂 Article 📅 2011 🏛 Elsevier 🌐 English ⚖ 244 KB

A greedy algorithm for some classes of i

A greedy algorithm for some classes of integer programs

✍ V.V. Shenmaier 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 144 KB

We establish a necessary and su cient condition for a greedy algorithm to ÿnd an optimal solution in the case of integer programs with separable concave objective functions. This extends some well-known results for spanning trees, matroids, and greedoids. As a corollary we obtain one new generalizat

A greedy algorithm for solving a class o

A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory

✍ G. Morton; R. von Randow; K. Ringwald 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 162 KB