BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES

スポンサーリンク

概要

• 論文の詳細を見る

• While travel cost in urban areas is generally best modeled using network distances, continuous distance measures are mostly used for location problems in rural environments. Combining both is not only interesting from a modeling perspective, but has also computational advantages since it combines reduced storage requirements for the network data with a high accuracy of the approximated distances. In this paper, Weber problems with combined distance measures are discussed. If continuous distances are measured using block norm distances, the resulting Weber problems can be represented by bilinear programming formulations. Theoretical properties of this model are discussed, and two possible solution strategies are suggested.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Pfeiffer Barbara

  University Of Erlangen-nuremberg

• Klamroth Kathrin

  University of Erlangen-Nuremberg

関連論文

• BILINEAR PROGRAMMING FORMULATIONS FOR WEBER PROBLEMS WITH CONTINUOUS AND NETWORK DISTANCES

スポンサーリンク