Parallel Scatter Search Approach for the MinMax Regret Location Problem

E-ISSN： 1947-8291|9|2|1-17

ISSN： 1947-8283

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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 schemes for the Min-Max Starting Time Problem

By Epstein Leah Tassa Tamir

Acta Informatica, Vol. 40, Iss. 9, 2004-09 ,pp. : 657-674

Springer Publishing Company

Access to resources Recommend Favorite

Min–Max Inequalities and the Timing Verification Problem with Max and Linear Constraints

By Cheng Yiping Zheng Da-Zhong

Discrete Event Dynamic Systems, Vol. 15, Iss. 2, 2005-06 ,pp. : 119-143

Springer Publishing Company

Access to resources Recommend Favorite

A tabu search approach to the uncapacitated facility location problem

By Al-Sultan K.S. Al-Fawzan M.A.

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 91-103

Springer Publishing Company

Access to resources Recommend Favorite

On Absorbing Cycles in Min–Max Digraphs

By Günzel Harald Jongen Hubertus

Journal of Global Optimization, Vol. 31, Iss. 1, 2005-01 ,pp. : 85-92

Springer Publishing Company

Access to resources Recommend Favorite