✦ LIBER ✦

Bounding algorithm for the routing problem with arbitrary paths and alternative servers

✍ Scribed by S. V. Sevast'yanov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for the rob

✍ R. Montemanni; L.M. Gambardella; A.V. Donati 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 239 KB

A branch and bound algorithm for the cap

✍ G. Laporte; Y. Nobert 📂 Article 📅 1983 🏛 Springer 🌐 German ⚖ 643 KB

A branch-and-bound algorithm for the asy

✍ G. Laporte; Y. Nobert; S. Taillefer 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 771 KB

A mean-time comparison of algorithms for

✍ W. D. Kelton; A. M. Law 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB

An exact algorithm for the elementary sh

✍ Dominique Feillet; Pierre Dejax; Michel Gendreau; Cyrille Gueguen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

A branch-and-price algorithm for the cap

✍ Christian H. Christiansen; Jens Lysgaard 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 164 KB