zbMATH — the first resource for mathematics

Traffic assignment in communication satellites. (English) Zbl 0526.90065

90C10 Integer programming
90B35 Deterministic scheduling theory in operations research
65K05 Numerical mathematical programming methods
90C90 Applications of mathematical programming
Full Text: DOI
[1] Arnold, H., An efficient digital satellite technique for serving users of differing capacities, (), 6.1dash116-119
[2] Camerini, P.; Maffioli, F.; Tartara, P., Some scheduling algorithms for SS/TDMA systems, (), 405-409
[3] Christofides, N., Graph theory: an algorithmic approach, (1975), Wiley · Zbl 0321.94011
[4] Chvatal, V., A greedy heuristic for the set covering problem, Mathematics of operations research, 4, 233-235, (1979) · Zbl 0443.90066
[5] Ford, L.R.; Fulkerson, D.R., Flows in networks, (1962), Princeton University Press · Zbl 0139.13701
[6] Gross, O., The bottleneck assignment problem: an algorithm, (), 87-88
[7] Hall, P., On the representation of subsets, Journal of the London mathematical society, 10, 26-30, (1935) · Zbl 0010.34503
[8] Inukai, T., An efficient SS/TDMA time slot assignment algorithm, (), 1449-1455
[9] Ito, Y.; Urano, Y.; Muratani, T.; Yamaguchi, M., Analysis of a switch matrix for an SS/TDMA system, (), 411-419
[10] Kuhn, H.W., The Hungarian method for the assignment problem, Naval research logistics quarterly, 2, 83-97, (1955) · Zbl 0143.41905
[11] Lawler, E.L., Combinatorial optimization: networks and matroids, (1976), Holt, Rinehart and Winston · Zbl 0358.68059
[12] Schmidt, W., An on-board switched multiple access system for millimeter wave satellites, (), 399-406
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.