{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:40:45Z","timestamp":1767339645095,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192112"},{"type":"electronic","value":"9783030192129"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19212-9_29","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"443-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Solution Methods for the Cumulative-Interference Channel Assignment Problem Using Integer Optimization and Constraint Programming"],"prefix":"10.1007","author":[{"given":"Paul J.","family":"Nicholas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karla L.","family":"Hoffman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-007-0178-0","volume":"153","author":"KI Aardal","year":"2007","unstructured":"Aardal, K.I., Van Hoesel, S.P., Koster, A.M., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153(1), 79\u2013129 (2007)","journal-title":"Ann. Oper. Res."},{"key":"29_CR2","unstructured":"Alion Science and Technology Corporation: TIREM RF Modeling (2017). \n                    https:\/\/www.alionscience.com\/terrain-integrated-rough-earth-model-tirem\/"},{"key":"29_CR3","unstructured":"Analytical Graphics Inc.: Engineering Tools (2018). \n                    http:\/\/www.agi.com\/products\/engineering-tools"},{"key":"29_CR4","unstructured":"Berry, L.: The potential contribution of optimum frequency assignment to efficient use of the spectrum. In: IEEE International Symposium on Electromagnetic Compatibility, pp. 409\u2013412. IEEE (1990)"},{"issue":"9","key":"29_CR5","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/ett.4460050219","volume":"5","author":"M Cuppini","year":"1994","unstructured":"Cuppini, M.: A genetic algorithm for channel assignment problems. Eur. Trans. Telecommun. 5(2), 285\u2013294 (1994)","journal-title":"Eur. Trans. Telecommun."},{"issue":"4","key":"29_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1052871.1052872","volume":"8","author":"K Daniels","year":"2004","unstructured":"Daniels, K., Chandra, K., Liu, S., Widhani, S.: Dynamic channel assignment with cumulative co-channel interference. ACM SIGMOBILE Mob. Comput. Commun. Rev. 8(4), 4\u201318 (2004)","journal-title":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"29_CR8","unstructured":"Department of Defense: Integrated Security Construct-B. Multi-Service Force Deployment, scenario 3 (2013)"},{"key":"29_CR9","unstructured":"Dunkin, N., Bater, J., Jeavons, P., Cohen, D.: Towards high order constraint representations for the frequency assignment problem. University of London, Egham, Surrey, UK, Technical report (1998)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"El-Bardan, R., Brahma, S., Varshney, P.K.: Power control with jammer location uncertainty: a game theoretic perspective. In: 48th Annual Conference on Information Sciences and Systems, pp. 1\u20136. IEEE (2014)","DOI":"10.1109\/CISS.2014.6814091"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(99)00254-4","volume":"123","author":"M Fischetti","year":"2000","unstructured":"Fischetti, M., Lepschy, C., Minerva, G., Romanin-Jacur, G., Toto, E.: Frequency assignment in mobile radio systems using branch-and-cut techniques. Eur. J. Oper. Res. 123(2), 241\u2013255 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR12","unstructured":"Github: CAP datasets (2019). \n                    https:\/\/github.com\/nickelpickle1\/cap_dataset\/"},{"key":"29_CR13","unstructured":"Goldstein, P.: Pentagon strikes deal with broadcasters, clearing way for 1755\u20131780 MHz auction. Fierce Wireless, February 2013. \n                    http:\/\/www.fiercewireless.com"},{"key":"29_CR14","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Science Conference (SciPy 2008), pp. 11\u201315. Pasadena, CA USA, August 2008"},{"key":"29_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3226-5","volume-title":"Pyomo-Optimization modeling in Python","author":"WE Hart","year":"2012","unstructured":"Hart, W.E., Laird, C., Watson, J.P., Woodruff, D.L.: Pyomo-Optimization modeling in Python, vol. 67. Springer Science & Business Media, New York (2012). \n                    https:\/\/doi.org\/10.1007\/978-1-4614-3226-5"},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Program. 96(1), 33\u201360 (2003)","journal-title":"Math. Program."},{"key":"29_CR17","unstructured":"IBM: IBM CPLEX Optimization Studio (2018). \n                    http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/CPLEX-optimizer\/"},{"key":"29_CR18","unstructured":"Johannson, F., et al.: mpmath: A Python library for arbitrary-precision floating-point arithmetic (version 0.18) (2013). \n                    http:\/\/mpmath.org"},{"issue":"3","key":"29_CR19","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/98.511762","volume":"3","author":"I Katzela","year":"1996","unstructured":"Katzela, I., Naghshineh, M.: Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey. IEEE J. Pers. Commun. 3(3), 10\u201331 (1996)","journal-title":"IEEE J. Pers. Commun."},{"key":"29_CR20","unstructured":"Kiddoo, J., et al.: Operations research enables auction to repurpose television spectrum for next-generation wireless technologies. INFORMS J. Appl. Anal. (2018, submitted)"},{"issue":"1\u20132","key":"29_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logistics Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logistics Q."},{"issue":"9","key":"29_CR22","first-page":"68","volume":"38","author":"JP London","year":"2015","unstructured":"London, J.P.: The new wave of warfare-Battling to dominate the electromagnetic spectrum. J. Electron. Defense (JED) 38(9), 68\u201376 (2015)","journal-title":"J. Electron. Defense (JED)"},{"issue":"1","key":"29_CR23","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(02)00239-1","volume":"129","author":"C Mannino","year":"2003","unstructured":"Mannino, C., Sassano, A.: An enumerative algorithm for the frequency assignment problem. Discrete Appl. Math. 129(1), 155\u2013169 (2003)","journal-title":"Discrete Appl. Math."},{"key":"29_CR24","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-540-68279-0_17","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"F Margot","year":"2010","unstructured":"Margot, F.: Symmetry in integer linear programming. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 647\u2013686. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-540-68279-0_17"},{"key":"29_CR25","unstructured":"Metzger, B.: Spectrum management technique. In: 38th National ORSA Meeting (1970)"},{"key":"29_CR26","unstructured":"Nicholas, P.J.: Optimal spectrum allocation to support tactical mobile ad-hoc networks. Ph.D. thesis, George Mason University (2016)"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Nicholas, P.J., Hoffman, K.L.: Computational challenges of dynamic channel assignment for military MANET. In: Proceedings of the Military Communications Conference (MILCOM), pp. 1150\u20131157. IEEE (2015)","DOI":"10.1109\/MILCOM.2015.7357601"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Nicholas, P.J., Hoffman, K.L.: Optimal channel assignment for military MANET using integer optimization and constraint programming. In: Proceedings of the Military Communications Conference (MILCOM), pp. 1114\u20131120. IEEE (2016)","DOI":"10.1109\/MILCOM.2016.7795479"},{"key":"29_CR29","doi-asserted-by":"crossref","unstructured":"Nicholas, P.J., Hoffman, K.L.: Analysis of spectrum allocation to support mobile ad-hoc networks in contested environments. In: Proceedings of the Military Communications Conference (MILCOM), pp. 145\u2013150. IEEE (2018)","DOI":"10.1109\/MILCOM.2018.8599736"},{"key":"29_CR30","unstructured":"O\u2019Neil, R.J., Hoffman, K.: Integer models for the asymmetric traveling salesman problem with pickup and delivery (2018). \n                    optimization-online.org"},{"issue":"1","key":"29_CR31","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126(1), 147\u2013178 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"29_CR32","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1111\/j.1475-3995.2008.00630.x","volume":"15","author":"M Palpant","year":"2008","unstructured":"Palpant, M., Oliva, C., Artigues, C., Michelon, P., Didi Biha, M.: Models and methods for frequency assignment with cumulative interference constraints. Int. Trans. Oper. Res. 15(3), 307\u2013324 (2008)","journal-title":"Int. Trans. Oper. Res."},{"key":"29_CR33","unstructured":"Poisel, R.: Modern Communications Jamming: Principles and Techniques. Artech House (2011)"},{"key":"29_CR34","unstructured":"Ramani, A., Aloul, F.A., Markov, I.L., Sakallah, K.A.: Breaking instance-independent symmetries in exact graph coloring. In: Proceedings of the Design, Automation and Test in Europe Conference and Exhibition, vol. 1, pp. 324\u2013329. IEEE (2004)"},{"key":"29_CR35","unstructured":"Selyukh, A.: In switch, U.S. military offers to share airwaves with industry, Thomson Reuters (2013)"},{"issue":"1","key":"29_CR36","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR37","first-page":"489","volume-title":"Hybrid Optimization: The Ten Years of CPAIOR","author":"M Trick","year":"2010","unstructured":"Trick, M.: Sports scheduling. In: Van Hentenryck, P., Milano, M. (eds.) Hybrid Optimization: The Ten Years of CPAIOR, pp. 489\u2013508. Springer Science & Business Media, New York (2010)"},{"issue":"10","key":"29_CR38","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1109\/26.41163","volume":"37","author":"SW Wang","year":"1989","unstructured":"Wang, S.W., Rappaport, S.S.: Signal-to-interference calculations for balanced channel assignment patterns in cellular communications systems. IEEE Trans. Commun. 37(10), 1077\u20131087 (1989)","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"29_CR39","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/JSAC.2012.120102","volume":"30","author":"Y Wu","year":"2012","unstructured":"Wu, Y., Wang, B., Liu, K.R., Clancy, T.C.: Anti-jamming games in multi-channel cognitive radio networks. IEEE J. Sel. Areas Commun. 30(1), 4\u201315 (2012)","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19212-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:09:57Z","timestamp":1558984197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}