{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T13:27:45Z","timestamp":1680442065290},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1007\/bf01416610","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T19:24:03Z","timestamp":1112556243000},"page":"281-307","source":"Crossref","is-referenced-by-count":2,"title":["A heuristic for decomposing traffic matrices in TDMA satellite communication"],"prefix":"10.1007","volume":"38","author":[{"given":"G\ufffdnter","family":"Rote","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Vogel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0167-6377(83)90045-7","volume":"2","author":"E Balas","year":"1983","unstructured":"Balas E, Landweer PR (1983) Traffic assignment in communication satellites.Operations Research Letters 2:141?147","journal-title":"Operations Research Letters"},{"key":"CR2","volume-title":"Fair Representation ? Meeting the Ideal of One Man, One Vote","author":"ML Balinski","year":"1982","unstructured":"Balinski ML, Young HP (1982)Fair Representation ? Meeting the Ideal of One Man, One Vote. Yale University Press, New Haven and London"},{"key":"CR3","unstructured":"Bollob\u00e1s B (1985)Random Graphs. Academic Press"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s B, Thomason A (1985) Random graphs of small order.Random Graphs '83: First Pozna? Seminar on Random Graphs, August 1983, (M. Karo?ski and A. Ruci?ski, eds.),Ann. Discr. Math., vol. 28, North-Holland, pp. 47?97","DOI":"10.1016\/S0304-0208(08)73612-0"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02260498","volume":"35","author":"RE Burkard","year":"1985","unstructured":"Burkard RE (1985) Time-slot assignment for TDMA-systems.Computing 35:99?112","journal-title":"Computing"},{"key":"CR6","first-page":"35","volume-title":"Time division multiple access systems and matrix decomposition","author":"RE Burkard","year":"1991","unstructured":"Burkard RE (1991) Time division multiple access systems and matrix decomposition.Proceedings of the Fourth European Conference on Mathematics in Industry (ECMI 4), (H. Wacker and W. Zulehner, eds.), B. G. Teubner, Stuttgart, and Kluwer Academic Publishers, Dordrecht, pp. 35?46"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Burkard RE, Derigs U (1980)Assignment and Matching Problems. Solution Methods with FORTRAN-Programs. Lecture Notes in Economics and Mathematical Systems, vol. 184, Springer-Verlag","DOI":"10.1007\/978-3-642-51576-7"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0211043","volume":"11","author":"R Cole","year":"1982","unstructured":"Cole R, Hopcroft J (1982) On edge coloring bipartite graphs.SIAM J. Computing 11:540?546","journal-title":"SIAM J. Computing"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","volume":"24","author":"GN Frederickson","year":"1982","unstructured":"Frederickson GN, Johnson DB (1982) The complexity of selection and ranking in X+Y and matrices with sorted columns.J. Computer and System Sciences 24:197?208","journal-title":"J. Computer and System Sciences"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","volume":"9","author":"HN Gabow","year":"1988","unstructured":"Gabow HN, Tarjan RE (1988) Algorithms for two bottleneck optimization problems.J. Algorithms 9:411?417","journal-title":"J. Algorithms"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/TCOM.1985.1096336","volume":"COM-33","author":"IS Gopal","year":"1985","unstructured":"Gopal IS, Wong CK (1985) Minimizing the number of switchings in an SS\/TDMA system.IEEE Trans. Comm. COM-33:497?501","journal-title":"IEEE Trans. Comm."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft JE, Karp RM (1973) Ann 5\/2 algorithm for maximum matching in bipartite graphs.SIAM J. Computing 2:225?231","journal-title":"SIAM J. Computing"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1109\/PROC.1978.11184","volume":"66","author":"T Inukai","year":"1978","unstructured":"Inukai T (1978) Comments on ?Analysis of a switch matrix for an SS\/TDMA system?.Proc. IEEE 66:1669?1670","journal-title":"Proc. IEEE"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1109\/TCOM.1979.1094297","volume":"COM-27","author":"T Inukai","year":"1979","unstructured":"Inukai T (1979) An efficient SS\/TDMA time slot assignment algorithm.IEEE Trans. Comm. COM-27:1449?1455","journal-title":"IEEE Trans. Comm."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1109\/PROC.1977.10493","volume":"65","author":"Y Ito","year":"1977","unstructured":"Ito Y, Urano Y, Muratani T, Yamaguchi M (1977) Analysis of a switch matrix for an SS\/TDMA system.Proc. IEEE 65:411?419","journal-title":"Proc. IEEE"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1109\/TCOM.1983.1095734","volume":"COM-31","author":"JL Lewandowski","year":"1983","unstructured":"Lewandowski JL, Liu JWS, Liu CL (1983) SS\/TDMA time slot assignment with restricted switching modes.IEEE Trans. Comm. COM-31:149?154","journal-title":"IEEE Trans. Comm."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1051\/ro\/1986200402731","volume":"20","author":"M Minoux","year":"1986","unstructured":"Minoux M (1986) Optimal traffic assignment in a SS\/TDMA frame: a new approach by set covering and column generation.RAIRO Recherche Op\u00e9rationelle\/Operations Research 20:273?286","journal-title":"RAIRO Recherche Op\u00e9rationelle\/Operations Research"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1137\/0403011","volume":"3","author":"JL Petit","year":"1990","unstructured":"Petit JL, T\u00e9rouanne E (1990) A theory of proportional representation.SIAM J. Discrete Math. 3:116?139","journal-title":"SIAM J. Discrete Math."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0167-6377(85)90042-2","volume":"4","author":"F Rendl","year":"1985","unstructured":"Rendl F (1985) On the complexity of decomposing matrices arising in satellite communication.Oper. Res. Lett. 4:5?8","journal-title":"Oper. Res. Lett."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0377-2217(89)90389-5","volume":"41","author":"CC Ribeiro","year":"1989","unstructured":"Ribeiro CC, Minoux M, Penna MC (1989) An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment.European J. Operational Research 41:232?239","journal-title":"European J. Operational Research"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"T29","DOI":"10.1002\/zamm.19890690115","volume":"69","author":"G Rote","year":"1989","unstructured":"Rote G (1989) Eine Heuristik f\u00fcr ein Matrizenzerlegungsproblem, das in der Telekommunikation via Satelliten auftritt (Kurzfassung).ZAMM Z. angew. Math. Mech. 69:T29-T31","journal-title":"ZAMM Z. angew. Math. Mech."},{"key":"CR22","unstructured":"Rote G, Vogel A (1990) A heuristic for decomposing traffic matrices in TDMA satellite communication. Report 1990-73, Technische Universit\u00e4t Graz, Institut f\u00fcr Mathematik, February 1990"},{"key":"CR23","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"RE Tarjan","year":"1983","unstructured":"Tarjan RE (1983)Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia 1983"},{"issue":"4","key":"CR24","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/BF03026117","volume":"8","author":"DR Woodall","year":"1986","unstructured":"Woodall DR (1986) How proportional is proportional representation?Math. Intelligencer 8(4):36?46","journal-title":"Math. Intelligencer"}],"container-title":["ZOR Zeitschrift f\ufffd Operations Research Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01416610.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01416610\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01416610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T17:26:17Z","timestamp":1586193977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01416610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["BF01416610"],"URL":"https:\/\/doi.org\/10.1007\/bf01416610","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}