{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:04:59Z","timestamp":1747652699759},"reference-count":20,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0305-0548(98)00012-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:00:05Z","timestamp":1027638005000},"page":"729-743","source":"Crossref","is-referenced-by-count":4,"title":["New bounds for optimum traffic assignment in satellite communication"],"prefix":"10.1016","volume":"25","author":[{"given":"Mauro","family":"Dell'Amico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Trubian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(98)00012-4_BIB1","doi-asserted-by":"crossref","first-page":"2901","DOI":"10.1002\/j.1538-7305.1978.tb02182.x","article-title":"Efficient utilization of satellite transponders via time-division multibeam scanning","volume":"57","author":"Acampora","year":"1978","journal-title":"The Bell Syst. Technol. J."},{"key":"10.1016\/S0305-0548(98)00012-4_BIB2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0167-6377(83)90045-7","article-title":"Traffic assignment in communication satellites","volume":"2","author":"Balas","year":"1983","journal-title":"Opin. Res. Lett."},{"key":"10.1016\/S0305-0548(98)00012-4_BIB3","unstructured":"Camerini, P. M., Maffioli, F. and Tartara, G., Some scheduling algorithms for SS\/TDMA systems. Proc. 5th Inter. Conf. on Digital Sat. Commun., 1981, 405\u2013409"},{"key":"10.1016\/S0305-0548(98)00012-4_BIB4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0167-6377(95)00043-7","article-title":"Open-Shop, satellite communication and a theorem by Egerv\u00e1ry (1931)","volume":"18","author":"Dell'Amico","year":"1996","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0305-0548(98)00012-4_BIB5","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0166-218X(97)00120-0","article-title":"The K-cardinality assignment problem","volume":"76","author":"Dell'Amico","year":"1997","journal-title":"Discr. Appl. Math."},{"key":"10.1016\/S0305-0548(98)00012-4_BIB6","unstructured":"Dell'Amico, M. and Martello, S., Linear Assignment. In Annotated Bibliographies in Combinatorial Optimization, eds. M. Dell'Amico, F. Maffioli and S. Martello. J. Wiley and Sons, Chichester, 1997"},{"key":"10.1016\/S0305-0548(98)00012-4_BIB7","unstructured":"Dell'Amico, M., Lodi, A. and Maffioli, F., Solution of the cumulative assignment problem with a well-structured tabu search method. Materiali di Discussione 209, University of Modena, 1997"},{"key":"10.1016\/S0305-0548(98)00012-4_BIB8","unstructured":"Dell'Amico, M. and Trubian, M., Solution of large weighted equicut problems. E.J.O.R., 1997, to appear"},{"key":"10.1016\/S0305-0548(98)00012-4_BIB9","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1109\/26.135730","article-title":"SS\/TDMA scheduling for satellite clusters","volume":"40","author":"Ganz","year":"1992","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0305-0548(98)00012-4_BIB10","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open shop scheduling tominimize finish time","volume":"23","author":"Gonzales","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0305-0548(98)00012-4_BIB11","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0305-0548(98)00012-4_BIB12","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1109\/TCOM.1979.1094297","article-title":"An efficient SS\/TDMA time-slot assignment algorithm","volume":"27","author":"Inukai","year":"1979","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0305-0548(98)00012-4_BIB13","unstructured":"Glover, F. and Laguna, M., Tabu search. In Modern Heuristic Techniques for Combinatorial Problems, ed. C. Reeves. Blackwell Scientific Publishing, Oxford, 1993, pp. 70\u2013141"},{"key":"10.1016\/S0305-0548(98)00012-4_BIB14","unstructured":"Lawler, E., Combinatorial optimization: networks and matroids, Holt, Reinehart and Winston, 1976"},{"key":"10.1016\/S0305-0548(98)00012-4_BIB15","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1057\/jors.1994.99","article-title":"An overview of scheduling problems arising in satellite communications","volume":"45","author":"Prins","year":"1994","journal-title":"J. Opl. Res. Soc."},{"key":"10.1016\/S0305-0548(98)00012-4_BIB16","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","article-title":"A genetic algorithm for flowshop sequencing","volume":"41","author":"Reeves","year":"1995","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0305-0548(98)00012-4_BIB17","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0167-6377(85)90042-2","article-title":"On the complexity of decomposing matrices arising in satellite communications","volume":"4","author":"Rendl","year":"1985","journal-title":"Opin. Res. Lett."},{"key":"10.1016\/S0305-0548(98)00012-4_BIB18","doi-asserted-by":"crossref","unstructured":"Reudink, D. O., Spot beams promise satellite communications breakthrough. IEEE Spectrum, 1978, 36\u201342","DOI":"10.1109\/MSPEC.1978.6367869"},{"key":"10.1016\/S0305-0548(98)00012-4_BIB19","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0377-2217(89)90389-5","article-title":"An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment","volume":"41","author":"Ribeiro","year":"1989","journal-title":"E.J.O.R."},{"key":"10.1016\/S0305-0548(98)00012-4_BIB20","first-page":"219","article-title":"A model for TDMA burst assignment and scheduling","volume":"6","author":"Sinha","year":"1976","journal-title":"COMSAT Tech. Rev."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054898000124?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054898000124?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:22:09Z","timestamp":1555190529000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054898000124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":20,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0305054898000124"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(98)00012-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}