Calculating solution-value bounds for a geostationary-satellite location problem
DOI10.1016/0377-2217(90)90093-QzbMATH Open0715.90073OpenAlexW2065919034MaRDI QIDQ751998FDOQ751998
Fernando Mata, Charles H. Reilly
Publication date: 1990
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(90)90093-q
Numerical mathematical programming methods (65K05) Linear programming (90C05) Applications of mathematical programming (90C90) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11) Continuous location (90B85)
Cites Work
Cited In (3)
Recommendations
- Optimal finite thrust geostationary satellite positioning with operational constraints π π
- The solution of the general geodetic boundary value problem by least squares π π
- Numerical search of bounded relative satellite motion π π
- Computational optimization in solving the geodetic boundary value problems π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- On the solution of the GPS localization and circle fitting problems π π
- Improved Direct Solution of the Global Positioning System Equation π π
This page was built for publication: Calculating solution-value bounds for a geostationary-satellite location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751998)