✦ LIBER ✦

Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems

✍ Scribed by Abraham P. Punnen and K. P. K. Nair

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial algorithms for a class of lin

✍ J. F. Maurras; K. Truemper; M. Akgül 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 858 KB

Optimality conditions for a class of non

✍ Zalmai, G.J. 📂 Article 📅 1986 🏛 Taylor and Francis Group 🌐 English ⚖ 609 KB

Duality for a Class of Minmax and Inexac

✍ C.R. Bector; S. Chandra; V. Kumar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 344 KB

Polynomial expected behavior of a pivoti

✍ Michael J. Todd 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 974 KB

An algorithm for solving a structured cl

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

An Inequality Sorting Algorithm for a Cl

✍ V. Lakshmikantham; S.K. Sen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 282 KB