{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:33:09Z","timestamp":1761888789428,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s13675-013-0015-y","type":"journal-article","created":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T01:42:05Z","timestamp":1383702125000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimizing compatible sets in wireless networks through integer programming"],"prefix":"10.1016","volume":"2","author":[{"given":"Yuan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Pi\u00f3ro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Di","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinshu","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1007\/s13675-013-0015-y_CR1","doi-asserted-by":"crossref","unstructured":"Andrews M, Dinitz M (2009) Maximizing capacity in arbitrary wireless networks in the SINR model: complexity and game theory. In: IEEE INFOCOM. pp 1332\u20131340","DOI":"10.1109\/INFCOM.2009.5062048"},{"issue":"4","key":"10.1007\/s13675-013-0015-y_CR2","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.adhoc.2003.09.002","article-title":"A column generation method for spatial TDMA scheduling in ad hoc networks","volume":"2","author":"Bj\u00f6rklund","year":"2004","journal-title":"Ad Hoc Netw"},{"key":"10.1007\/s13675-013-0015-y_CR3","doi-asserted-by":"crossref","unstructured":"Brar G, Blough D, Santi P (2006) Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks. In: ACM MOBICOM. pp 2\u201313","DOI":"10.1145\/1161089.1161092"},{"issue":"6","key":"10.1007\/s13675-013-0015-y_CR4","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.adhoc.2009.11.003","article-title":"Routing, scheduling and channel assignment in wireless mesh networks: optimization models and algorithms","volume":"8","author":"Capone","year":"2010","journal-title":"Ad Hoc Netw"},{"issue":"3","key":"10.1007\/s13675-013-0015-y_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.20367","article-title":"Solving a resource allocation problem in wireless mesh networks: a comparison between a CP-based and a classical column generation","volume":"55","author":"Capone","year":"2010","journal-title":"Networks"},{"issue":"5","key":"10.1007\/s13675-013-0015-y_CR6","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1109\/TWC.2011.030311.100777","article-title":"A new computational approach for maximum link activation in wireless networks under the SINR model","volume":"10","author":"Capone","year":"2011","journal-title":"IEEE Trans. Wirel Commun."},{"issue":"2","key":"10.1007\/s13675-013-0015-y_CR7","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. ACM"},{"issue":"1","key":"10.1007\/s13675-013-0015-y_CR8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/TWC.2003.819032","article-title":"Joint scheduling and power control for wireless ad hoc networks","volume":"3","author":"Elbatt","year":"2004","journal-title":"IEEE Trans Wirel Commun"},{"issue":"4","key":"10.1007\/s13675-013-0015-y_CR9","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"J ACM"},{"key":"10.1007\/s13675-013-0015-y_CR10","unstructured":"Goldberg A, Tsioutsiouliklis K (1999) Cut tree algorithms. In: The 10th ACM-SIAM symposium on discrete algorithms (SODA). pp 376\u2013385"},{"key":"10.1007\/s13675-013-0015-y_CR11","unstructured":"Goldsmith A (2005) Wireless communicaitons. Cambridge University Press, Cambridge"},{"key":"10.1007\/s13675-013-0015-y_CR12","doi-asserted-by":"crossref","unstructured":"Goussevskaia O, Oswald Y, Wattenhofer R (2007) Complexity in geometric SINR. In: ACM MOBIHOC. pp 100\u2013109","DOI":"10.1145\/1288107.1288122"},{"key":"10.1007\/s13675-013-0015-y_CR13","doi-asserted-by":"crossref","unstructured":"Goussevskaia O, Wattenhofer R, Halldorsson M, Welzl E (2009) Capacity of arbitrary wireless networks. In: IEEE INFOCOM. pp 1872\u20131880","DOI":"10.1109\/INFCOM.2009.5062108"},{"issue":"1","key":"10.1007\/s13675-013-0015-y_CR14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0219009","article-title":"Very simple methods for all pairs network flow analysis","volume":"19","author":"Gusfield","year":"1999","journal-title":"SIAM J Comput"},{"key":"10.1007\/s13675-013-0015-y_CR15","doi-asserted-by":"crossref","unstructured":"Kesselheim T (2011) A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In: The 22nd ACM-SIAM symposium on discrete algorithms (SODA). pp 1549\u20131559","DOI":"10.1137\/1.9781611973082.120"},{"key":"10.1007\/s13675-013-0015-y_CR16","unstructured":"Korte B, Vygen J (2006) Combinatorial optimization: theory and algorithms, 3rd edn. Springer, Berlin"},{"issue":"7","key":"10.1007\/s13675-013-0015-y_CR17","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/j.adhoc.2006.04.005","article-title":"A joint scheduling, power control, and routing algorithm for ad hoc wireless networks","volume":"5","author":"Li","year":"2007","journal-title":"Ad Hoc Netw"},{"key":"10.1007\/s13675-013-0015-y_CR18","doi-asserted-by":"crossref","unstructured":"Li Y, Pi\u00f3ro M, Yuan D, Su J (2012) On joint optimization of link rate assignment and transmission scheduling in wireless mesh networks. In: The 15th international telecommunications network strategy and planning symposium (Networks). pp 1\u20136","DOI":"10.1109\/NETWKS.2012.6381711"},{"key":"10.1007\/s13675-013-0015-y_CR19","unstructured":"Pi\u00f3ro M (2011) A report on minimum odd-cut generation with applications to network design. Technical report, Institute of Telecommunications, Warsaw University of Technology"},{"key":"10.1007\/s13675-013-0015-y_CR20","unstructured":"Pi\u00f3ro M, \u017botkiewicz M, Staehle B, Staehle D, Yuan D (2011) On max-min fair flow optimization in wireless mesh networks. Ad Hoc Netw. 10.1016\/j.adhoc.2011.05.003"},{"key":"10.1007\/s13675-013-0015-y_CR21","unstructured":"Schrijver A (2003) Combinatorial optimization\u2014polyhedra and efficiency. Springer, Berlin"},{"key":"10.1007\/s13675-013-0015-y_CR22","unstructured":"Tsioutsiouliklis K (1999) Cut tree algorithms: an experimental study. http:\/\/www.cs.princeton.edu\/kt\/cut-tree\/. Accessed 10 Oct 2012"},{"issue":"3","key":"10.1007\/s13675-013-0015-y_CR23","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/JSAC.2005.862408","article-title":"Throughput-range tradeoff of wireless mesh backhaul networks","volume":"24","author":"Viswanathan","year":"2006","journal-title":"IEEE J Sel Areas Commun"},{"key":"10.1007\/s13675-013-0015-y_CR24","doi-asserted-by":"crossref","unstructured":"Xu X, Tang S (2009) A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model. In: The 2nd ACM international workshop on foundations of wireless ad hoc and sensor networking and computing (FOWANC). pp 13\u201320","DOI":"10.1145\/1540343.1540347"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0015-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-013-0015-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219244062100023X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219244062100023X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0015-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:53Z","timestamp":1761882353000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S219244062100023X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["S219244062100023X"],"URL":"https:\/\/doi.org\/10.1007\/s13675-013-0015-y","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimizing compatible sets in wireless networks through integer programming","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-013-0015-y","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}