EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Constrained Weber problem"
Narrow search

Narrow search

Year of publication
Subject
All
Bound test 2 Choice of starting point 2 Constrained Weber problem 2 Fixed region 2 Greedy choice 2
Online availability
All
Undetermined 2
Type of publication
All
Article 2
Language
All
Undetermined 2
Author
All
Jiang, Jian-lin 2 Xu, Ya 2
Published in...
All
Computational Statistics 1 Mathematical Methods of Operations Research 1
Source
All
RePEc 2
Showing 1 - 2 of 2
Cover Image
Minisum location problem with farthest Euclidean distances
Jiang, Jian-lin; Xu, Ya - In: Mathematical Methods of Operations Research 64 (2006) 2, pp. 285-308
The paper formulates an extended model of Weber problem in which the customers are represented by convex demand regions. The objective is to generate a site in R <Superscript>2</Superscript> that minimizes the sum of weighted Euclidean distances between the new facility and the farthest points of demand regions. This...</superscript>
Persistent link: https://www.econbiz.de/10010999737
Saved in:
Cover Image
Minisum location problem with farthest Euclidean distances
Jiang, Jian-lin; Xu, Ya - In: Computational Statistics 64 (2006) 2, pp. 285-308
The paper formulates an extended model of Weber problem in which the customers are represented by convex demand regions. The objective is to generate a site in R 2 that minimizes the sum of weighted Euclidean distances between the new facility and the farthest points of demand regions. This...
Persistent link: https://www.econbiz.de/10010759335
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...