Modeling the satellite placement problem as a network flow problem with one side constraint
DOI10.1007/BF01719766zbMATH Open0714.90056OpenAlexW2089236131MaRDI QIDQ751497FDOQ751497
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
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
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)
Cites Work
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- New Finite Pivoting Rules for the Simplex Method
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Optimality and Degeneracy in Linear Programming
- Title not available (Why is that?)
- Theoretical Properties of the Network Simplex Method
- Network flow problems with one side constraint: A comparison of three solution methods
- A network simplex method
- Solving singularly constrained generalized network problems
Cited In (9)
- 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
- A novel approach to subgraph selection with multiple weights on arcs
Uses Software
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)
