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

Minimax Location of Two Facilities with Minimum Separation: Interactive Graphical Solutions

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

DOI10.1057/jors.1991.134zbMath0737.90038OpenAlexW1992867716MaRDI QIDQ3983489

Lee Papayanopoulos, I. Douglas Moon

Publication date: 27 June 1992

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1991.134


zbMATH Keywords

minimax locationfranchise facilityinteractive graphical methodminimum covering ellipse


Mathematics Subject Classification ID

Continuous location (90B85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)


Related Items (4)

The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm ⋮ Solving the anti-covering location problem using Lagrangian relaxation ⋮ The obnoxious \(p\) facility network location problem with facility interaction ⋮ Two-facility Location Games with Minimum Distance Requirement




This page was built for publication: Minimax Location of Two Facilities with Minimum Separation: Interactive Graphical Solutions

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