Modeling the satellite placement problem as a network flow problem with one side constraint
type: Item
instance of: scholarly article
title: Modeling the satellite placement problem as a network flow problem with one side constraint
zbMATH Open document ID: 0714.90056
DOI: 10.1007/BF01719766
author: Susan B. Spälti
author: Thomas M. Liebling
published in: OR Spektrum
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 4176819
zbMATH Keywords: placement of telecommunication satellites
zbMATH Keywords: geostationary orbit
zbMATH Keywords: network simplex method
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: Network flow problems with one side constraint: A comparison of three solution methods
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: Optimality and Degeneracy in Linear Programming
cites work: A network simplex method
cites work: Theoretical Properties of the Network Simplex Method
cites work: The generalized simplex method for minimizing a linear form under linear inequality restraints
cites work: Solving singularly constrained generalized network problems
cites work: Q3968758
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
full work available at URL: https://doi.org/10.1007/bf01719766
OpenAlex ID: W2089236131
description: scientific article; zbMATH DE number 4176819