{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:35:44Z","timestamp":1648953344922},"reference-count":44,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4095,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0166-218x(02)00176-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:28:09Z","timestamp":1027578489000},"page":"299-322","source":"Crossref","is-referenced-by-count":4,"title":["Erratum to \u201cComparison of column generation models for channel assignment in cellular networks\u201d"],"prefix":"10.1016","volume":"118","author":[{"given":"Brigitte","family":"Jaumard","sequence":"first","affiliation":[]},{"given":"Odile","family":"Marcotte","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Meyer","sequence":"additional","affiliation":[]},{"given":"Tsevi","family":"Vovor","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00176-2_BIB1","unstructured":"K.I. Aardal, A. Hipolito, C.P.M. van Hoesel, A branch-and-cut algorithm for the frequency assignment problem, manuscript, 1997."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB2","unstructured":"P. Adjakpl\u00e9, Affectation de canaux dans les r\u00e9seaux de t\u00e9l\u00e9phonie mobile cellulaire, Ph.D. Thesis, \u00c9cole Polytechnique de Montr\u00e9al, Montr\u00e9al, Canada, 1998."},{"issue":"4","key":"10.1016\/S0166-218X(02)00176-2_BIB3","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/90.413218","article-title":"Code assignment for hidden terminal interference avoidance in multihop packet radio networks","volume":"3","author":"Bertossi","year":"1995","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1018908907763","article-title":"Frequency assignment in cellular phone networks","volume":"76","author":"Bornd\u00f6rfer","year":"1998","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB5","unstructured":"CPLEX, Using the CPLEXTM Callable Library (Version 6.0), CPLEX Optimization Inc., 1998."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB6","series-title":"Constrained Routing and Scheduling, Handbooks in Operations Research and Management Science, Vol. 8","author":"Desrosiers","year":"1996"},{"issue":"1","key":"10.1016\/S0166-218X(02)00176-2_BIB7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/25.192382","article-title":"Channel assignment for cellular radio using simulated annealing","volume":"VT-42","author":"Duque-Ant\u00f3n","year":"1993","journal-title":"IEEE Trans. Veh. Technol."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","article-title":"Stabilized column generation","volume":"194","author":"du Merle","year":"1999","journal-title":"Disc. Math."},{"issue":"2","key":"10.1016\/S0166-218X(02)00176-2_BIB9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(99)00254-4","article-title":"Frequency assignment in mobile radio systems using branch-and-cut techniques","volume":"123","author":"Fischetti","year":"2000","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/S0166-218X(02)00176-2_BIB10","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/T-VT.1982.23925","article-title":"Homogeneous distribution of frequencies in a regular hexagonal cell system","volume":"VT-31","author":"Gamst","year":"1982","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"1","key":"10.1016\/S0166-218X(02)00176-2_BIB11","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","article-title":"Some lower bounds for a class of frequency assignment problems","volume":"VT-35","author":"Gamst","year":"1986","journal-title":"IEEE Trans. Veh. Technol."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB12","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-completeness, W.H. Freeman, San Francisco, CA, 1979."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB13","doi-asserted-by":"crossref","unstructured":"A.I. Giortzis, L.F. Turner, A mathematical programming approach to the channel assignment problem in radio networks, Proceedings IEEE 46th Vehicular Technology Conference, Vol. 2, 1996, pp. 736\u2013740.","DOI":"10.1109\/VETEC.1996.501409"},{"issue":"12","key":"10.1016\/S0166-218X(02)00176-2_BIB14","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment: theory and applications","volume":"68","author":"Hale","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB15","unstructured":"P. Hansen, B. Jaumard, C. Meyer, An simple enumrtative algorithm for unconstrained 0\u20131 quadratic programming, Les Cahiers du GERAD G-2000-59, GERAD, Montreal, Canada, November 2000."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB16","unstructured":"P. Hansen, B. Jaumard, N. Mladenovic, A. Parreira, Variable neighbourhood search for maximum weight satisfiability problem, Les Cahiers du GERAD G-2000-62, GERAD, Montreal, Canada, November 2000."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB17","unstructured":"C.A.J. Hurkens, S.R. Tiourine, Upper and lower bounding techniques for frequency assignment problems, 1995, ftp:\/\/ftp.win.tue.nl\/pub\/techreports\/cosor\/95-34.ps."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB18","doi-asserted-by":"crossref","unstructured":"S. Hurley, S.U. Thiel, D.H. Smith, A comparison of local search algorithms for radio link frequency assignment problems, ACM Symposium on Applied Computing, Philadelphia, 1996, pp. 251\u2013257.","DOI":"10.1145\/331119.331186"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB19","unstructured":"J. Janssen, K. Kilakos, Polyhedral analysis of channel assignment problems: (I) tours, Technical Report CDAM-96-17, London School of Economics and Political Science, August 1996."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB20","unstructured":"J. Janssen, K. Kilakos, Polyhedral analysis of channel assignment problems: (II) tilings, Technical Report CDAM-96-17, London School of Economics and Political Science, August 1996."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB21","unstructured":"B. Jaumard, D. Boyer, T. Vovor, PULSAR \u2013 a method for optimizing channel assignment in bell mobilit\u00e9 cellular systems with arbitrary channel blocks, manuscript, 1998."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB22","unstructured":"B. Jaumard, O. Marcotte, C. Meyer, Estimation of the quality of cellular networks using column generation techniques, Les Cahiers du GERAD G-98-02, GERAD, Montreal, Canada, January 1998."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB23","series-title":"Telecommunications Network Planning","first-page":"239","article-title":"Mathematical models and exact methods for channel assignment in cellular networks","author":"Jaumard","year":"1998"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB24","unstructured":"B. Jaumard, C. Meyer, T. Vovor, A compact formulation of the antenna channel spacing constraints, manuscript, 1999."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB25","series-title":"Mobile Networks and Computing","article-title":"How to combine a column and row generation method with a column or row elimination procedure \u2013 application to a channel assignment problem","author":"Jaumard","year":"2000"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB26","unstructured":"B. Jaumard, T. Vovor, A column generation approach for the exact solution of channel assignment problems, Les Cahiers du GERAD G-98-39, GERAD, Montr\u00e9al, Canada, July 1998."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB27","unstructured":"B. Jaumard, T. Vovor, F. Semet, A two-phase resource constrained shortest path algorithm, Networks, to appear."},{"issue":"3","key":"10.1016\/S0166-218X(02)00176-2_BIB28","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0167-6377(98)00043-1","article-title":"The partial constraint satisfaction problem: facets and lifting theorems","volume":"23","author":"Koster","year":"1998","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB29","unstructured":"S. Krau, Extensions du probl\u00e8me de Weber, Ph.D. Thesis, \u00c9cole Polytechnique de Montr\u00e9al, Montr\u00e9al Canada, 1997."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB30","series-title":"Mobile Cellular Telecommunications: Analog and Digital Systems","author":"Lee","year":"1995"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB31","doi-asserted-by":"crossref","unstructured":"A. Mehrotra, M.A. Trick, A column generation approach for graph coloring, INFORMS J. Comput. 8(4) (1996) 344\u2013354.","DOI":"10.1287\/ijoc.8.4.344"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB32","series-title":"The GSM System for Mobile Communications","author":"Mouly","year":"1992"},{"issue":"5","key":"10.1016\/S0166-218X(02)00176-2_BIB33","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1992.71","article-title":"A strong cutting plane\/branch-and-bound algorithm for node packing","volume":"43","author":"Nemhauser","year":"1992","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB34","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","article-title":"Properties of vertex packing and independence system polyhedra","volume":"6","author":"Nemhauser","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB35","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","article-title":"Vertex packings: structural properties and algorithms","volume":"8","author":"Nemhauser","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB36","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB37","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Math. Programming"},{"issue":"2","key":"10.1016\/S0166-218X(02)00176-2_BIB38","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","article-title":"Computational aspects of a branch-and-bound algorithm for quadratic zero\u2013one programming","volume":"45","author":"Pardalos","year":"1990","journal-title":"Computing"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB39","series-title":"Wireless Communications \u2013 Principles & Practice","author":"Rappaport","year":"1996"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB40","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0012-365X(96)00257-9","article-title":"Bounds for the frequency assignment problem","volume":"167\/168","author":"Smith","year":"1997","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/S0166-218X(02)00176-2_BIB41","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/90.554720","article-title":"A new lower bound for the frequency assignment problem","volume":"5","author":"Tcha","year":"1997","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0166-218X(02)00176-2_BIB42","unstructured":"S. Thienel, ABACUS 2.2, User's Guide and Reference Manual, Technical Report, Universit\u00e4t zu K\u00f6ln, 1998, http:\/\/www.informatik.uni-koeln.de\/ls\\_juenger\/projects\/abacus\/html\/manual.html."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB43","unstructured":"S. Tiourine, C. Hurkens, J.L. Lenstra, An overview of algorithmic approaches to frequency assignment problems, 1995, ftp:\/\/ftp.win.tue.nl\/pub\/techreports\/CALMA\/overview.ps."},{"key":"10.1016\/S0166-218X(02)00176-2_BIB44","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0166-218X(96)00139-4","article-title":"A potential reduction approach to the frequency assignment problem","volume":"78","author":"Warners","year":"1997","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02001762?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02001762?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T22:10:07Z","timestamp":1578435007000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02001762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0166218X02001762"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00176-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}