A simple and effective algorithm for the MaxMin diversity problem

Author： Porumbel Daniel Hao Jin-Kao Glover Fred

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.186, Iss.1, 2011-06, pp. : 275-293

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

Max-min ant system algorithm for dartboard design

By Vlachos Aristidis Trichas Ioannis

International Journal of Computational Intelligence Studies, Vol. 2, Iss. 3-4, 2013-11 ,pp. : 367-378

Inderscience Publishers

Access to resources Recommend Favorite

Max-min sum minimization transportation problem

By Puri Sonia Puri M.

Annals of Operations Research, Vol. 145, Iss. 1, 2006-07 ,pp. : 385-385

Springer Publishing Company

Access to resources Recommend Favorite

Max-min sum minimization transportation problem

By Puri Sonia Puri M.

Annals of Operations Research, Vol. 143, Iss. 1, 2006-03 ,pp. : 265-275

Springer Publishing Company

Access to resources Recommend Favorite

The max-min hill-climbing Bayesian network structure learning algorithm

By Tsamardinos Ioannis

Machine Learning, Vol. 65, Iss. 1, 2006-10 ,pp. : 31-78

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