Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Solving rectilinear planar location problems with barriers by a polynomial partitioning

From MaRDI portal
Publication:1872030
Jump to:navigation, search

DOI10.1023/A:1020997518554zbMath1041.90027MaRDI QIDQ1872030

P. M. Dearing, R. Segars jun.

Publication date: 4 May 2003

Published in: Annals of Operations Research (Search for Journal in Brave)


zbMATH Keywords

barrierrectilinear distancesingle facility location


Mathematics Subject Classification ID

Continuous location (90B85) Nonlinear programming (90C30)


Related Items (5)

Continuous location model of a rectangular barrier facility ⋮ Rectilinear distance to a facility in the presence of a square barrier ⋮ The rectilinear distance Weber problem in the presence of a probabilistic line barrier ⋮ A wavefront approach to center location problems with barriers ⋮ Planar location problems with block distance and barriers




This page was built for publication: Solving rectilinear planar location problems with barriers by a polynomial partitioning

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1872030&oldid=14262930"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki