Calculating solution-value bounds for a geostationary-satellite location problem

DOI10.1016/0377-2217(90)90093-QMaRDI QIDQ751998zbMATH OpenOpenAlexFDO

Authors Charles H. Reilly, Fernando Mata

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

zbMATH Keywords

decompositionvalid inequalitiesLP-relaxationbounding techniquesatellite location

Mathematics Subject Classification ID

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)

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
• scientific article; zbMATH DE number 2015309
• scientific article; zbMATH DE number 1740222
• On the solution of the GPS localization and circle fitting problems
• Improved Direct Solution of the Global Positioning System Equation

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A two-phase procedure for allotting geostationary orbital locations to communications satellites

Cited in

(6)

• Improved Direct Solution of the Global Positioning System Equation
• Modeling the satellite placement problem as a network flow problem with one side constraint
• scientific article; zbMATH DE number 4064729 (Why is no real title available?)
• Optimal finite thrust geostationary satellite positioning with operational constraints
• Solving the swath segment selection problem through Lagrangean relaxation
• A two-phase procedure for allotting geostationary orbital locations to communications satellites

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)