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

Spherical minimax location problem

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

DOI10.1023/A:1011248622793zbMath0987.90051OpenAlexW106228940MaRDI QIDQ5942944

No author found.

Publication date: 17 June 2002

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011248622793


zbMATH Keywords

algorithmgeodesic normminimax location


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)


Related Items (8)

Concepts and techniques of optimization on the sphere ⋮ Borda winner in facility location problems on sphere ⋮ On the spherical convexity of quadratic functions ⋮ Projections onto convex sets on the sphere ⋮ An extragradient-type algorithm for variational inequality on Hadamard manifolds ⋮ Solving \(k\)-center problems involving sets based on optimization techniques ⋮ Unnamed Item ⋮ A polynomial time algorithm for a hemispherical minimax location problem




This page was built for publication: Spherical minimax location problem

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