A Market-based Solution to the Multiple Traveling Salesmen Problem

By Kivelevitch Elad   Cohen Kelly   Kumar Manish  

Journal of Intelligent and Robotic Systems, Vol. 72, Iss. 1, 2013-10 ,pp. : 21-40

Springer Publishing Company

Access to resources Recommend Favorite

Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems

By Khani M.   Salavatipour Mohammad  

Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. : 443-460

Springer Publishing Company

Access to resources Recommend Favorite

Parallel Scatter Search Approach for the MinMax Regret Location Problem

By  

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 9, Iss. 2, 2018-04 ,pp. : 1-17

IGI Global_journal

Access to resources Recommend Favorite

Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems

By Aissi Hassene  

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 4, 2006-12 ,pp. : 347-350

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems

By Frederickson Greg   Wittman Barry  

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 1198-1221

Springer Publishing Company

Access to resources Recommend Favorite