A BSSS algorithm for the location problem with minimum square error
From MaRDI portal
(Redirected from Publication:606175)
Recommendations
- Efficient methods for goal square Weber location problem
- A BSSS algorithm for the single facility location problem in two regions with different norms
- GBSSS: The generalized big square small square method for planar single- facility location
- An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
- The big cube small cube solution method for multidimensional facility location problems
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- A BSSS algorithm for the single facility location problem in two regions with different norms
- Constrained location of competitive facilities in the plane
- GBSSS: The generalized big square small square method for planar single- facility location
- Locating a minisum circle in the plane
- On the circle closest to a set of points
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- The Minisum and Minimax Location Problems Revisited
Cited in
(5)- Backup multifacility location problem with \(l_p\) norm
- Efficient methods for goal square Weber location problem
- GBSSS: The generalized big square small square method for planar single- facility location
- A BSSS algorithm for the single facility location problem in two regions with different norms
- The bicriterion semi-obnoxious location (BSL) problem solved by an -approximation
This page was built for publication: A BSSS algorithm for the location problem with minimum square error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606175)
