✦ LIBER ✦

An efficient parallel logarithmic time algorithm for the channel routing problem

✍ Scribed by Dorothea Wagner; Frank Wagner

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 562 KB
Volume: 40
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90022-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient lower bound algorithm for c

An efficient lower bound algorithm for channel routing

✍ Heng-Yi Chao; Mary P. Harper 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 999 KB

Efficient logarithmic time parallel algo

Efficient logarithmic time parallel algorithms for the cholesky decomposition and gram-schmidt process

✍ Ilan Bar-On 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 393 KB

An efficient parallel algorithm for the

An efficient parallel algorithm for the single function coarsest partition problem

✍ Joseph F. Jájá; Kwan Woo Ryu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1006 KB

Time-Efficient Parallel Algorithms for t

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems

✍ Jean-Frédéric Myoupo; David Semé 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 135 KB

An exact algorithm for the asymmetrical

An exact algorithm for the asymmetrical capacitated vehicle routing problem

✍ Gilbert Laporte; Hélène Mercure; Yves Nobert 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

An exact algorithm for the asymmetrical

An exact algorithm for the asymmetrical capacitated vehicle routing problem

✍ Gilbert Laporte; Hélène Mercure; Yves Nobert 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

The aim of this article is to develop an exact algorithm for the asymmetrical capacitated vehicle routing problem, i.e., the multiple traveling salesman problem subject to capacity restrictions. The problem is solved by means of a branch and bound tree in which subproblems are modified assignment pr