The ordered anti-median problem with distances derived from a strictly convex norm
In this paper we consider a general model for locating a repulsive facility in a bounded polygonal region. In order to have a finite set of candidates for the ordered anti-median problem, the class of strictly convex distances must be restricted. For this case an O(sn5) time algorithm is proposed, w...
Gespeichert in:
| Veröffentlicht in: | Discrete Applied Mathematics 2013-03, Vol.161 (4-5), p.642-649 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 649 |
|---|---|
| container_issue | 4-5 |
| container_start_page | 642 |
| container_title | Discrete Applied Mathematics |
| container_volume | 161 |
| creator | Lozano, Antonio J. Mesa, Juan A. Plastria, Frank |
| description | In this paper we consider a general model for locating a repulsive facility in a bounded polygonal region. In order to have a finite set of candidates for the ordered anti-median problem, the class of strictly convex distances must be restricted. For this case an O(sn5) time algorithm is proposed, where s is an uniform bound on the number of intersections of two bisectors. |
| doi_str_mv | 10.1016/j.dam.2012.10.015 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671590464</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0166218X12003952</els_id><sourcerecordid>1323223446</sourcerecordid><originalsourceid>FETCH-LOGICAL-c358t-ef7d096488e1f5df4aee81c9cfbd49ee263557dd75e209dc44c739cd04a4377c3</originalsourceid><addsrcrecordid>eNqFkE1LAzEQhoMoWKs_wFuOXnbN12528STFLygIUsFbSJNZmrK7qUla7b83pZ71NMzwvMPMg9A1JSUltL5dl1YPJSOU5b4ktDpBE9pIVtRS0lM0yUxdMNp8nKOLGNeEZJI2E_S2WAH2wUIAi_WYXDGAdXrEm-CXPQz4y6UVti4mPRqIOINul9Eu-AFrHFNwJvV7bPy4g288-jBcorNO9xGufusUvT8-LGbPxfz16WV2Py8Mr5pUQCctaWvRNEC7ynZCAzTUtKZbWtECsJpXlbRWVsBIa40QRvLWWCK04FIaPkU3x7351M8txKQGFw30vR7Bb6OitaRVS0Qt_kc544xxIeqM0iNqgo8xQKc2wQ067BUl6qBarVVWrQ6qD6OsOmfujhnI7-4cBBWNg-zLugAmKevdH-kfQtaHFA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1323223446</pqid></control><display><type>article</type><title>The ordered anti-median problem with distances derived from a strictly convex norm</title><source>Elsevier ScienceDirect Journals Complete</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Lozano, Antonio J. ; Mesa, Juan A. ; Plastria, Frank</creator><creatorcontrib>Lozano, Antonio J. ; Mesa, Juan A. ; Plastria, Frank</creatorcontrib><description>In this paper we consider a general model for locating a repulsive facility in a bounded polygonal region. In order to have a finite set of candidates for the ordered anti-median problem, the class of strictly convex distances must be restricted. For this case an O(sn5) time algorithm is proposed, where s is an uniform bound on the number of intersections of two bisectors.</description><identifier>ISSN: 0166-218X</identifier><identifier>EISSN: 1872-6771</identifier><identifier>DOI: 10.1016/j.dam.2012.10.015</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Algorithms ; Convex distances ; Facility location ; Intersections ; Mathematical analysis ; Mathematical models ; Norms ; Ordered median</subject><ispartof>Discrete Applied Mathematics, 2013-03, Vol.161 (4-5), p.642-649</ispartof><rights>2012 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c358t-ef7d096488e1f5df4aee81c9cfbd49ee263557dd75e209dc44c739cd04a4377c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.dam.2012.10.015$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Lozano, Antonio J.</creatorcontrib><creatorcontrib>Mesa, Juan A.</creatorcontrib><creatorcontrib>Plastria, Frank</creatorcontrib><title>The ordered anti-median problem with distances derived from a strictly convex norm</title><title>Discrete Applied Mathematics</title><description>In this paper we consider a general model for locating a repulsive facility in a bounded polygonal region. In order to have a finite set of candidates for the ordered anti-median problem, the class of strictly convex distances must be restricted. For this case an O(sn5) time algorithm is proposed, where s is an uniform bound on the number of intersections of two bisectors.</description><subject>Algorithms</subject><subject>Convex distances</subject><subject>Facility location</subject><subject>Intersections</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Norms</subject><subject>Ordered median</subject><issn>0166-218X</issn><issn>1872-6771</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNqFkE1LAzEQhoMoWKs_wFuOXnbN12528STFLygIUsFbSJNZmrK7qUla7b83pZ71NMzwvMPMg9A1JSUltL5dl1YPJSOU5b4ktDpBE9pIVtRS0lM0yUxdMNp8nKOLGNeEZJI2E_S2WAH2wUIAi_WYXDGAdXrEm-CXPQz4y6UVti4mPRqIOINul9Eu-AFrHFNwJvV7bPy4g288-jBcorNO9xGufusUvT8-LGbPxfz16WV2Py8Mr5pUQCctaWvRNEC7ynZCAzTUtKZbWtECsJpXlbRWVsBIa40QRvLWWCK04FIaPkU3x7351M8txKQGFw30vR7Bb6OitaRVS0Qt_kc544xxIeqM0iNqgo8xQKc2wQ067BUl6qBarVVWrQ6qD6OsOmfujhnI7-4cBBWNg-zLugAmKevdH-kfQtaHFA</recordid><startdate>201303</startdate><enddate>201303</enddate><creator>Lozano, Antonio J.</creator><creator>Mesa, Juan A.</creator><creator>Plastria, Frank</creator><general>Elsevier B.V</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201303</creationdate><title>The ordered anti-median problem with distances derived from a strictly convex norm</title><author>Lozano, Antonio J. ; Mesa, Juan A. ; Plastria, Frank</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c358t-ef7d096488e1f5df4aee81c9cfbd49ee263557dd75e209dc44c739cd04a4377c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Convex distances</topic><topic>Facility location</topic><topic>Intersections</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Norms</topic><topic>Ordered median</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lozano, Antonio J.</creatorcontrib><creatorcontrib>Mesa, Juan A.</creatorcontrib><creatorcontrib>Plastria, Frank</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Discrete Applied Mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lozano, Antonio J.</au><au>Mesa, Juan A.</au><au>Plastria, Frank</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The ordered anti-median problem with distances derived from a strictly convex norm</atitle><jtitle>Discrete Applied Mathematics</jtitle><date>2013-03</date><risdate>2013</risdate><volume>161</volume><issue>4-5</issue><spage>642</spage><epage>649</epage><pages>642-649</pages><issn>0166-218X</issn><eissn>1872-6771</eissn><abstract>In this paper we consider a general model for locating a repulsive facility in a bounded polygonal region. In order to have a finite set of candidates for the ordered anti-median problem, the class of strictly convex distances must be restricted. For this case an O(sn5) time algorithm is proposed, where s is an uniform bound on the number of intersections of two bisectors.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.dam.2012.10.015</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0166-218X |
| ispartof | Discrete Applied Mathematics, 2013-03, Vol.161 (4-5), p.642-649 |
| issn | 0166-218X 1872-6771 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1671590464 |
| source | Elsevier ScienceDirect Journals Complete; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Algorithms Convex distances Facility location Intersections Mathematical analysis Mathematical models Norms Ordered median |
| title | The ordered anti-median problem with distances derived from a strictly convex norm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T19%3A39%3A13IST&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%20ordered%20anti-median%20problem%20with%20distances%20derived%20from%20a%20strictly%20convex%20norm&rft.jtitle=Discrete%20Applied%20Mathematics&rft.au=Lozano,%20Antonio%20J.&rft.date=2013-03&rft.volume=161&rft.issue=4-5&rft.spage=642&rft.epage=649&rft.pages=642-649&rft.issn=0166-218X&rft.eissn=1872-6771&rft_id=info:doi/10.1016/j.dam.2012.10.015&rft_dat=%3Cproquest_cross%3E1323223446%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=1323223446&rft_id=info:pmid/&rft_els_id=S0166218X12003952&rfr_iscdi=true |