A new assignment rule to improve seed points algorithms for the continuous k-center problem

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.104, Iss.2, 1998-01, pp. : 366-374

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

Heuristic and exact algorithms for the simultaneous assignment problem

By Yamada T. Nasu Y.

European Journal of Operational Research, Vol. 123, Iss. 3, 2000-06 ,pp. : 531-542

Elsevier

Access to resources Recommend Favorite

A note on exact algorithms for the bottleneck generalized assignment problem

By Martello S. Toth P.

European Journal of Operational Research, Vol. 83, Iss. 3, 1995-06 ,pp. : 711-712

Elsevier

Access to resources Recommend Favorite

On the single-assignment p-hub center problem

By Kara B.Y. Tansel B.C.

European Journal of Operational Research, Vol. 125, Iss. 3, 2000-09 ,pp. : 648-655

Elsevier

Access to resources Recommend Favorite

Algorithms for the robust 1-center problem on a tree

By Averbakh I. Berman O.

European Journal of Operational Research, Vol. 123, Iss. 2, 2000-06 ,pp. : 292-302

Elsevier

Access to resources Recommend Favorite

Solving an assignment-selection problem with verbal information and using genetic algorithms

By Herrera F. Lopez E. Mendana C. Rodrguez M.A.

European Journal of Operational Research, Vol. 119, Iss. 2, 1999-12 ,pp. : 326-337

Elsevier

Access to resources Recommend Favorite