{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T09:34:38Z","timestamp":1774690478406,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,31]],"date-time":"2007-10-31T00:00:00Z","timestamp":1193788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s10589-007-9143-8","type":"journal-article","created":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T16:52:10Z","timestamp":1193763130000},"page":"449-463","source":"Crossref","is-referenced-by-count":12,"title":["A combinatorial algorithm for the TDMA message scheduling problem"],"prefix":"10.1007","volume":"43","author":[{"given":"Clayton W.","family":"Commander","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,31]]},"reference":[{"issue":"4","key":"9143_CR1","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.comnet.2004.12.001","volume":"47","author":"I.F. Akyildiz","year":"2005","unstructured":"Akyildiz, I.F., Wang, X., Wang, W.: Wireless mesh networks: a survey. Comput. Netw. 47(4), 445\u2013487 (2005)","journal-title":"Comput. Netw."},{"key":"9143_CR2","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, P.R.: Traffic assignment in communications satellites. Oper. Res. Lett. 2, 141\u2013147 (1983)","journal-title":"Oper. Res. Lett."},{"key":"9143_CR3","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1109\/TCOM.1981.1095097","volume":"29","author":"G. Bongiovanni","year":"1981","unstructured":"Bongiovanni, G., Tang, D.T., Wong, C.K.: A general multibeam satellite switching algorithm. IEEE Trans. Commun. 29, 1025\u20131036 (1981)","journal-title":"IEEE Trans. Commun."},{"key":"9143_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02260498","volume":"35","author":"R.E. Burkard","year":"1985","unstructured":"Burkard, R.E.: Time-slot assignment for TDMA-systems. Computing 35, 99\u2013112 (1985)","journal-title":"Computing"},{"key":"9143_CR5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86, 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"9143_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1142\/9789812796592_0004","volume-title":"Theory and Algorithms for Cooperative Systems","author":"C.W. Commander","year":"2004","unstructured":"Commander, C.W., Butenko, S.I., Pardalos, P.M.: On the performance of heuristics for broadcast scheduling. In: Grundel, D., Murphey, R., Pardalos, P. (eds.) Theory and Algorithms for Cooperative Systems, pp. 63\u201380. World Scientific, Singapore (2004)"},{"key":"9143_CR7","unstructured":"Commander, C.W., Butenko, S.I., Pardalos, P.M., Oliveira, C.A.S.: Reactive grasp with path relinking for the broadcast scheduling problem. In: Proceedings of the 40th Annual International Telemetry Conference, pp. 792\u2013800, 2004"},{"issue":"4","key":"9143_CR8","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/26.52656","volume":"38","author":"A. Ephremides","year":"1990","unstructured":"Ephremides, A., Truong, T.V.: Scheduling broadcasts in multihop radio networks. IEEE Trans. Commun. 38(4), 456\u2013460 (1990)","journal-title":"IEEE Trans. Commun."},{"key":"9143_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"key":"9143_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"9143_CR11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","volume-title":"Essays and Surveys in Metaheuristics","author":"P. Festa","year":"2002","unstructured":"Festa, P., Resende, M.G.C.: GRASP: An annotated bibliography. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 325\u2013367. Kluwer Academic, Dordrecht (2002)"},{"key":"9143_CR12","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/26.156641","volume":"40","author":"A. Ganz","year":"1992","unstructured":"Ganz, A., Gao, Y.: Efficient algorithms for SS\/TDMA scheduling. IEEE Trans. Commun. 40, 1367\u20131374 (1992)","journal-title":"IEEE Trans. Commun."},{"key":"9143_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9143_CR14","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/381448.381456","volume-title":"Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications","author":"F.C. Gomes","year":"2001","unstructured":"Gomes, F.C., Pardalos, P.M., Oliveira, C.A.S., Resende, M.G.C.: Reactive GRASP with path relinking for channel assignment in mobile phone networks. In: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 60\u201367. ACM Press, New York (2001)"},{"key":"9143_CR15","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/18.21215","volume":"34","author":"B. Hajek","year":"1988","unstructured":"Hajek, B., Sasaki, G.: Link scheduling in polynomial time. IEEE Trans. Inform. Theory 34, 910\u2013918 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9143_CR16","volume-title":"Introduction to Operations Research","author":"F.S. Hillier","year":"2001","unstructured":"Hillier, F.S., Lieberman, G.J.: Introduction to Operations Research. McGraw\u2013Hill, New York (2001)"},{"key":"9143_CR17","series-title":"Nonconvex Optimization and its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-2025-2","volume-title":"Introduction to Global Optimization","author":"R. Horst","year":"1995","unstructured":"Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Nonconvex Optimization and its Applications, vol. 3. Kluwer Academic, Dordrecht (1995)"},{"key":"9143_CR18","unstructured":"Dash Optimization Inc. Xpress-Optimizer Reference Manual (2003)"},{"key":"9143_CR19","unstructured":"Kleinrock, L., Silvester, J.: Spatial reuse in multihop packet radio networks. In: Proceedings of the IEEE 75, 1987"},{"key":"9143_CR20","first-page":"8","volume":"9","author":"M. Krivelevich","year":"2002","unstructured":"Krivelevich, M.: Sparse graphs usually have exponentially many optimal colorings. Electron. J. Comb. 9, 8 (2002)","journal-title":"Electron. J. Comb."},{"issue":"2","key":"9143_CR21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1011237503342","volume":"19","author":"M. Laguna","year":"2001","unstructured":"Laguna, M., Mart\u00ed, R.: A GRASP for coloring sparse graphs. Comput. Optim. Appl. 19(2), 165\u2013178 (2001)","journal-title":"Comput. Optim. Appl."},{"issue":"1\/2","key":"9143_CR22","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1504\/IJOR.2005.007439","volume":"1","author":"C.A.S. Oliveira","year":"2005","unstructured":"Oliveira, C.A.S., Pardalos, P.M., Querido, T.M.: A combinatorial algorithm for message scheduling on controller area networks. Int. J. Oper. Res. 1(1\/2), 160\u2013171 (2005)","journal-title":"Int. J. Oper. Res."},{"key":"9143_CR23","first-page":"168","volume-title":"Handbook of Applied Optimization","author":"L.S. Pitsoulis","year":"2002","unstructured":"Pitsoulis, L.S., Resende, M.G.C.: Greedy randomized adaptive search procedures. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Applied Optimization, pp. 168\u2013183. Oxford University Press, London (2002)"},{"issue":"3","key":"9143_CR24","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.C.: Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12(3), 164\u2013176 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9143_CR25","unstructured":"Rendl, F.: Personal communication (1986)"},{"key":"9143_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-30165-5","volume-title":"Handbook of Optimization in Telecommunications","author":"M.G.C. Resende","year":"2006","unstructured":"Resende, M.G.C., Pardalos, P.M.: Handbook of Optimization in Telecommunications. Springer, Berlin (2006)"},{"key":"9143_CR27","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics","author":"M.G.C. Resende","year":"2003","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219\u2013249. Kluwer Academic, Dordrecht (2003)"},{"issue":"2","key":"9143_CR28","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/TWC.2003.808967","volume":"2","author":"S. Salcedo-Sanz","year":"2003","unstructured":"Salcedo-Sanz, S., Buso\u00f1o-Calz\u00f3n, C., Figueiral-Vidal, A.R.: A mixed neural-genetic algorithm for the broadcast scheduling problem. IEEE Trans. Wirel. Commun. 2(2), 277\u2013283 (2003)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"2","key":"9143_CR29","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1109\/49.552074","volume":"15","author":"G. Wang","year":"1997","unstructured":"Wang, G., Ansari, N.: Optimal broadcast scheduling in packet radio networks using mean field annealing. IEEE J. Sel. Areas Commun. 15(2), 250\u2013260 (1997)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9143_CR30","volume-title":"Integer Programming","author":"L. Wolsey","year":"1998","unstructured":"Wolsey, L.: Integer Programming. Wiley, New York (1998)"},{"key":"9143_CR31","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1016\/S0305-0548(01)00057-0","volume":"29","author":"J. Yeo","year":"2002","unstructured":"Yeo, J., Lee, H., Kim, S.: An efficient broadcast scheduling algorithm for TDMA ad-hoc networks. Comput. Oper. Res. 29, 1793\u20131806 (2002)","journal-title":"Comput. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9143-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9143-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9143-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T13:46:12Z","timestamp":1629985572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9143-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,31]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["9143"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9143-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,31]]}}}