Modeling the satellite placement problem as a network flow problem with one side constraint

DOI10.1007/BF01719766MaRDI QIDQ751497zbMATH OpenOpenAlexFDO

Authors Susan B. Spälti, Thomas M. Liebling

Publication date 1991

Published in OR Spektrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01719766

zbMATH Keywords

geostationary orbitnetwork simplex methodplacement of telecommunication satellites

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Recommendations

• A two-phase procedure for allotting geostationary orbital locations to communications satellites
• Calculating solution-value bounds for a geostationary-satellite location problem
• Deux problèmes d'ordonnancement en télécommunications par satellite
• Designing satellite communication networks by zero—one quadratic programming
• Multi-period traffic routing in satellite networks

Cites work

• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• A network simplex method
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Network flow problems with one side constraint: A comparison of three solution methods
• New Finite Pivoting Rules for the Simplex Method
• Optimality and Degeneracy in Linear Programming
• Solving singularly constrained generalized network problems
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• Theoretical Properties of the Network Simplex Method

Cited in

(9)

• A novel approach to subgraph selection with multiple weights on arcs
• A specialized network simplex algorithm for the constrained maximum flow problem
• A network simplex method for the budget-constrained minimum cost flow problem
• Designing satellite communication networks by zero—one quadratic programming
• Multi-period traffic routing in satellite networks
• Tactical and strategic models for satellite customer assignment
• On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies
• Metaheuristics: A bibliography
• A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: Modeling the satellite placement problem as a network flow problem with one side constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751497)