Solving Rectilinear Planar Location Problems with Barriers by a Polynomial Partitioning

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.111, Iss.1-4, 2002-03, pp. : 111-133

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

An Equivalence Result for Single Facility Planar Location Problems with Rectilinear Distance and Barriers

By Dearing P.M. Segars Jr. R.

Annals of Operations Research, Vol. 111, Iss. 1-4, 2002-03 ,pp. : 89-110

Springer Publishing Company

Access to resources Recommend Favorite

Self-organizing feature maps for solving location-allocation problems with rectilinear distances

By Hsieh K.-H. Tien F.-C.

Computers and Operations Research, Vol. 31, Iss. 7, 2004-06 ,pp. : 1017-1031

Elsevier

Access to resources Recommend Favorite

Planar Location Problems with Block Distance and Barriers

By Dearing P. Klamroth K. Segars R.

Annals of Operations Research, Vol. 136, Iss. 1, 2005-04 ,pp. : 117-143

Springer Publishing Company

Access to resources Recommend Favorite

Planar Weber location problems with barriers and block norms

By Hamacher Horst Klamroth Kathrin

Annals of Operations Research, Vol. 96, Iss. 1-4, 2000-11 ,pp. : 191-208

Springer Publishing Company

Access to resources Recommend Favorite

A Wavefront Approach to Center Location Problems with Barriers

By Frießs L. Klamroth K. Sprau M.

Annals of Operations Research, Vol. 136, Iss. 1, 2005-04 ,pp. : 35-48

Springer Publishing Company

Access to resources Recommend Favorite