✦ LIBER ✦

A simplex based algorithm for the lexicographically extended linear maxmin problem

✍ Scribed by Fred Alois Behringer

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 787 KB
Volume: 7
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(81)90349-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A sequential dual simplex algorithm for

A sequential dual simplex algorithm for the linear assignment problem

✍ Mustafa Akgül 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 406 KB

A sequential dual simplex algorithm for

A sequential dual simplex algorithm for the linear assignment problem

✍ Mustafa Akgül 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 32 KB

A linear time algorithm for the weighted

A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane

✍ Nir Halman 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 128 KB

A strongly polynomial simplex method for

A strongly polynomial simplex method for the linear fractional assignment problem

✍ Santosh N. Kabadi; Abraham P. Punnen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 339 KB

Computational experience with a polynomi

Computational experience with a polynomial-time dual simplex algorithm for the transportation problem

✍ Yoshiro Ikura; George L. Nemhauser 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 572 KB

A polynomial algorithm for the extendabi

A polynomial algorithm for the extendability problem in bipartite graphs

✍ J. Lakhal; L. Litzler 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Let G = [ y E] be a simple connected graph and let k be an integer such that 0 < k < 1 VI /2. G is said to be k-extendable if it contains a perfect matching and every matching of k edges extends to, i.e. is a subset of, a perfect matching. The extendability problem consists in finding the maximum va