✦ LIBER ✦

The maximum covering problem with travel time uncertainty

✍ Scribed by Berman, Oded; Hajizadeh, Iman; Krass, Dmitry

Book ID: 120488512
Publisher: Taylor and Francis Group
Year: 2013
Tongue: English
Weight: 525 KB
Volume: 45
Category: Article
ISSN: 0740-817X
DOI: 10.1080/0740817X.2012.689121

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Robust vehicle routing problem with dead

Robust vehicle routing problem with deadlines and travel time/demand uncertainty

✍ Lee, C; Lee, K; Park, S 📂 Article 📅 2012 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 307 KB

Maximal covering location problem (MCLP)

Maximal covering location problem (MCLP) with fuzzy travel times

✍ Soheil Davari; Mohammad Hossein Fazel Zarandi; Ahmad Hemmati 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Computing Approximate Solutions of the M

Computing Approximate Solutions of the Maximum Covering Problem with GRASP

✍ Mauricio G.C. Resende 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 140 KB

The Covering Canadian Traveller Problem

✍ Liao, Chung-Shou; Huang, Yamming 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 640 KB

Equivalence between the minimum covering

Equivalence between the minimum covering problem and the maximum matching problem

✍ Ján Plesník 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 127 KB

The minimum covering problem in weighted graphs with n vertices is transformed in time O(n 2) to the maximum matching problem with n or n + 1 vertices, and conversely.

The generalized covering traveling sales

The generalized covering traveling salesman problem

✍ Shaelaie, Mohammad H.; Salari, Majid; Naji-Azimi, Zahra 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 830 KB