THE MINIMAX-MIN LOCATION PROBLEM

THE MINIMAX-MIN LOCATION PROBLEM

ABSTRACT We consider a new objective function for the placement of a public facility with reference to variations in accessibility : the minimization of the range between the maximal and the minimal distances to users. Some properties of the solution are given; algorithms for the Euclidean and recti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of regional science 1986-02, Vol.26 (1), p.87-101
Hauptverfasser: Drezner, Z., Thisse, J.-F., Wesolowsky, G. O.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 101
container_issue 1
container_start_page 87
container_title Journal of regional science
container_volume 26
creator Drezner, Z.
Thisse, J.-F.
Wesolowsky, G. O.
description ABSTRACT We consider a new objective function for the placement of a public facility with reference to variations in accessibility : the minimization of the range between the maximal and the minimal distances to users. Some properties of the solution are given; algorithms for the Euclidean and rectilinear distance cases are presented.
doi_str_mv 10.1111/j.1467-9787.1986.tb00333.x
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1301726817</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1301726817</sourcerecordid><originalsourceid>FETCH-LOGICAL-c5107-b3893d5c4d1af13b61742a35ce9544f819c157a2c679788b235087c94a3f8c313</originalsourceid><addsrcrecordid>eNqVUMFOwkAQ3RhNRPQfGj1v3eluu1sPJogI1ZYSxOht0i5tQkXBLkT4e7cp4e5cXjIz772ZR8g1MBds3VYuiEDSUCrpQqgCd5Mzxjl3dyekcxydkg5jnkeF7ZyTC2MqxhgIEXSIMxsNnCQaR0nvg1p04rTfm0Xp2JlM04d4kFySszJbmuLqgF3y9jSY9Uc0TodRvxdT7QOTNOcq5HNfizlkJfA8ACm8jPu6CH0hSgWhBl9mng6kvUjlHveZkjoUGS-V5sC75KbVXdern21hNlittvW3tUTgDKQXKJB2667d0vXKmLoocV0vvrJ6j8CwSQQrbN7G5m1sEsFDIriz5PuW_LtYFvt_MPE5nb6qxp22AguzKXZHgaz-xEBy6eP7eIhx8jJ5FMMpSv4HSwpxvQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1301726817</pqid></control><display><type>article</type><title>THE MINIMAX-MIN LOCATION PROBLEM</title><source>Wiley Online Library Journals Frontfile Complete</source><source>Business Source Complete</source><source>Periodicals Index Online</source><creator>Drezner, Z. ; Thisse, J.-F. ; Wesolowsky, G. O.</creator><creatorcontrib>Drezner, Z. ; Thisse, J.-F. ; Wesolowsky, G. O.</creatorcontrib><description>ABSTRACT We consider a new objective function for the placement of a public facility with reference to variations in accessibility : the minimization of the range between the maximal and the minimal distances to users. Some properties of the solution are given; algorithms for the Euclidean and rectilinear distance cases are presented.</description><identifier>ISSN: 0022-4146</identifier><identifier>EISSN: 1467-9787</identifier><identifier>DOI: 10.1111/j.1467-9787.1986.tb00333.x</identifier><language>eng</language><publisher>Oxford, UK: Blackwell Publishing Ltd</publisher><ispartof>Journal of regional science, 1986-02, Vol.26 (1), p.87-101</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c5107-b3893d5c4d1af13b61742a35ce9544f819c157a2c679788b235087c94a3f8c313</citedby><cites>FETCH-LOGICAL-c5107-b3893d5c4d1af13b61742a35ce9544f819c157a2c679788b235087c94a3f8c313</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1111%2Fj.1467-9787.1986.tb00333.x$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1111%2Fj.1467-9787.1986.tb00333.x$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27846,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>Drezner, Z.</creatorcontrib><creatorcontrib>Thisse, J.-F.</creatorcontrib><creatorcontrib>Wesolowsky, G. O.</creatorcontrib><title>THE MINIMAX-MIN LOCATION PROBLEM</title><title>Journal of regional science</title><description>ABSTRACT We consider a new objective function for the placement of a public facility with reference to variations in accessibility : the minimization of the range between the maximal and the minimal distances to users. Some properties of the solution are given; algorithms for the Euclidean and rectilinear distance cases are presented.</description><issn>0022-4146</issn><issn>1467-9787</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1986</creationdate><recordtype>article</recordtype><sourceid>K30</sourceid><recordid>eNqVUMFOwkAQ3RhNRPQfGj1v3eluu1sPJogI1ZYSxOht0i5tQkXBLkT4e7cp4e5cXjIz772ZR8g1MBds3VYuiEDSUCrpQqgCd5Mzxjl3dyekcxydkg5jnkeF7ZyTC2MqxhgIEXSIMxsNnCQaR0nvg1p04rTfm0Xp2JlM04d4kFySszJbmuLqgF3y9jSY9Uc0TodRvxdT7QOTNOcq5HNfizlkJfA8ACm8jPu6CH0hSgWhBl9mng6kvUjlHveZkjoUGS-V5sC75KbVXdern21hNlittvW3tUTgDKQXKJB2667d0vXKmLoocV0vvrJ6j8CwSQQrbN7G5m1sEsFDIriz5PuW_LtYFvt_MPE5nb6qxp22AguzKXZHgaz-xEBy6eP7eIhx8jJ5FMMpSv4HSwpxvQ</recordid><startdate>198602</startdate><enddate>198602</enddate><creator>Drezner, Z.</creator><creator>Thisse, J.-F.</creator><creator>Wesolowsky, G. O.</creator><general>Blackwell Publishing Ltd</general><general>Regional Science Research Institute</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>FYSDU</scope><scope>GHEHK</scope><scope>IZSXY</scope><scope>K30</scope><scope>PAAUG</scope><scope>PAWHS</scope><scope>PAWZZ</scope><scope>PAXOH</scope><scope>PBHAV</scope><scope>PBQSW</scope><scope>PBYQZ</scope><scope>PCIWU</scope><scope>PCMID</scope><scope>PCZJX</scope><scope>PDGRG</scope><scope>PDWWI</scope><scope>PETMR</scope><scope>PFVGT</scope><scope>PGXDX</scope><scope>PIHIL</scope><scope>PISVA</scope><scope>PJCTQ</scope><scope>PJTMS</scope><scope>PLCHJ</scope><scope>PMHAD</scope><scope>PNQDJ</scope><scope>POUND</scope><scope>PPLAD</scope><scope>PQAPC</scope><scope>PQCAN</scope><scope>PQCMW</scope><scope>PQEME</scope><scope>PQHKH</scope><scope>PQMID</scope><scope>PQNCT</scope><scope>PQNET</scope><scope>PQSCT</scope><scope>PQSET</scope><scope>PSVJG</scope><scope>PVMQY</scope><scope>PZGFC</scope></search><sort><creationdate>198602</creationdate><title>THE MINIMAX-MIN LOCATION PROBLEM</title><author>Drezner, Z. ; Thisse, J.-F. ; Wesolowsky, G. O.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c5107-b3893d5c4d1af13b61742a35ce9544f819c157a2c679788b235087c94a3f8c313</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1986</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Drezner, Z.</creatorcontrib><creatorcontrib>Thisse, J.-F.</creatorcontrib><creatorcontrib>Wesolowsky, G. O.</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Periodicals Index Online Segment 07</collection><collection>Periodicals Index Online Segment 08</collection><collection>Periodicals Index Online Segment 30</collection><collection>Periodicals Index Online</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - West</collection><collection>Primary Sources Access (Plan D) - International</collection><collection>Primary Sources Access &amp; Build (Plan A) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Midwest</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Northeast</collection><collection>Primary Sources Access (Plan D) - Southeast</collection><collection>Primary Sources Access (Plan D) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Southeast</collection><collection>Primary Sources Access (Plan D) - South Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - UK / I</collection><collection>Primary Sources Access (Plan D) - Canada</collection><collection>Primary Sources Access (Plan D) - EMEALA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - South Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - International</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - International</collection><collection>Primary Sources Access (Plan D) - West</collection><collection>Periodicals Index Online Segments 1-50</collection><collection>Primary Sources Access (Plan D) - APAC</collection><collection>Primary Sources Access (Plan D) - Midwest</collection><collection>Primary Sources Access (Plan D) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Canada</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - EMEALA</collection><collection>Primary Sources Access &amp; Build (Plan A) - APAC</collection><collection>Primary Sources Access &amp; Build (Plan A) - Canada</collection><collection>Primary Sources Access &amp; Build (Plan A) - West</collection><collection>Primary Sources Access &amp; Build (Plan A) - EMEALA</collection><collection>Primary Sources Access (Plan D) - Northeast</collection><collection>Primary Sources Access &amp; Build (Plan A) - Midwest</collection><collection>Primary Sources Access &amp; Build (Plan A) - North Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - Northeast</collection><collection>Primary Sources Access &amp; Build (Plan A) - South Central</collection><collection>Primary Sources Access &amp; Build (Plan A) - Southeast</collection><collection>Primary Sources Access (Plan D) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - APAC</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - MEA</collection><jtitle>Journal of regional science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Drezner, Z.</au><au>Thisse, J.-F.</au><au>Wesolowsky, G. O.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>THE MINIMAX-MIN LOCATION PROBLEM</atitle><jtitle>Journal of regional science</jtitle><date>1986-02</date><risdate>1986</risdate><volume>26</volume><issue>1</issue><spage>87</spage><epage>101</epage><pages>87-101</pages><issn>0022-4146</issn><eissn>1467-9787</eissn><abstract>ABSTRACT We consider a new objective function for the placement of a public facility with reference to variations in accessibility : the minimization of the range between the maximal and the minimal distances to users. Some properties of the solution are given; algorithms for the Euclidean and rectilinear distance cases are presented.</abstract><cop>Oxford, UK</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1111/j.1467-9787.1986.tb00333.x</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0022-4146
ispartof Journal of regional science, 1986-02, Vol.26 (1), p.87-101
issn 0022-4146
1467-9787
language eng
recordid cdi_proquest_journals_1301726817
source Wiley Online Library Journals Frontfile Complete; Business Source Complete; Periodicals Index Online
title THE MINIMAX-MIN LOCATION PROBLEM
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T11%3A14%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=THE%20MINIMAX-MIN%20LOCATION%20PROBLEM&rft.jtitle=Journal%20of%20regional%20science&rft.au=Drezner,%20Z.&rft.date=1986-02&rft.volume=26&rft.issue=1&rft.spage=87&rft.epage=101&rft.pages=87-101&rft.issn=0022-4146&rft.eissn=1467-9787&rft_id=info:doi/10.1111/j.1467-9787.1986.tb00333.x&rft_dat=%3Cproquest_cross%3E1301726817%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1301726817&rft_id=info:pmid/&rfr_iscdi=true