✦ LIBER ✦

An optimal algorithm for 2 × n bottleneck transportation problems

✍ Scribed by Ravi Varadarajan

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 384 KB
Volume: 10
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(91)90072-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An instant solution of the 2 × n bottlen

An instant solution of the 2 × n bottleneck transportation problem

✍ Wlodzimierz Szwarc 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 182 KB

An algorithm for semi-infinite transport

An algorithm for semi-infinite transportation problems

✍ Shen-Yu Chen; Soon-Yi Wu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 292 KB

An optimal sublinear time parallel algor

An optimal sublinear time parallel algorithm for some dynamic programming problems

✍ Lawrence L. Larmore; Wojciech Rytter 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 366 KB

An O(n2) algorithm for the maximum cycle

An O(n2) algorithm for the maximum cycle mean of an n×n bivalent matrix

✍ P. Butkovic; R.A. Cuninghame-Green 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 503 KB

An optimal algorithm for reporting visib

An optimal algorithm for reporting visible rectangles

✍ N. Kitsios; C. Makris; S. Sioutas; A. Tsakalidis; J. Tsaknakis; B. Vassiliadis 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 75 KB

We consider the following problem as defined by Grove et al. [Internat. J. Comput. Geom. Appl. 9 (1999) 207-217]: Given a set of n isothetic rectangles in 3D space determine the subset of rectangles, that are not completely hidden. We present an optimal algorithm for this problem that runs in O(n lo

An algorithm for solving quadratic netwo

An algorithm for solving quadratic network flow problems

✍ N. Boland; C.J. Goh; A.I. Mees 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 333 KB

We describe a new algorithm for solving separable quadratic cost network programming problems and compare its performance with that of the convex simplex method for networks.