✦ LIBER ✦

A branch-and-cut algorithm for the maximum benefit Chinese postman problem

✍ Scribed by CorberÃ¡n, Ãngel; Plana, Isaac; RodrÃguez-ChÃa, Antonio M.; Sanchis, JosÃ© M.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate solutions for the maximum be

✍ Pearn, W. L.; Chiu, W. C. 📂 Article 📅 2005 🏛 Taylor and Francis Group 🌐 English ⚖ 164 KB

A branch-and-cut algorithm for the Undir

✍ Gianpaolo Ghiani; Gilbert Laporte 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 137 KB

A Heuristic Algorithm for the Mixed Chin

✍ Kriangchai Yaoyuenyong; Peerayuth Charnsethikul; Vira Chankong 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 336 KB

A new algorithm for the directed chinese

✍ Lin Yaxiong; Zhao Yongchang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 674 KB

Branch-and-Cut for the Maximum Feasible

✍ Pfetsch, Marc E. 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 202 KB

A branch-and-cut algorithm for the Winne

✍ Laureano F. Escudero; Mercedes Landete; Alfredo Marín 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 616 KB