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

DOI10.1007/BF01719766zbMath0714.90056OpenAlexW2089236131MaRDI QIDQ751497

Thomas M. Liebling, Susan B. Spälti

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

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

Related Items (4)

A novel approach to subgraph selection with multiple weights on arcs ⋮ Metaheuristics: A bibliography ⋮ A network simplex method for the budget-constrained minimum cost flow problem ⋮ A specialized network simplex algorithm for the constrained maximum flow problem

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Network flow problems with one side constraint: A comparison of three solution methods
• Solving singularly constrained generalized network problems
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A network simplex method
• New Finite Pivoting Rules for the Simplex Method
• Theoretical Properties of the Network Simplex Method
• Optimality and Degeneracy in Linear Programming

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