✦ LIBER ✦

Linear time algorithms for approximating the facility terminal cover problem

✍ Scribed by Guang Xu; Yang Yang; Jinhui Xu

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 413 KB
Volume: 50
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20172

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear-time algorithm for the k-fixed-

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs

✍ Katerina Asdre; Stavros D. Nikolopoulos 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB 👁 1 views

A linear time algorithm for the reverse

A linear time algorithm for the reverse 1-median problem on a cycle

✍ Rainer E. Burkard; Elisabeth Gassner; Johannes Hatzl 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

A dynamic programming algorithm for the

A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

✍ Ioachim, Irina; G�linas, Sylvie; Soumis, Fran�ois; Desrosiers, Jacques 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w