{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:00Z","timestamp":1759063500137},"reference-count":25,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"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":5768,"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":[[1997,10]]},"DOI":"10.1016\/s0166-218x(96)00139-4","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"251-282","source":"Crossref","is-referenced-by-count":13,"title":["A potential reduction approach to the frequency assignment problem"],"prefix":"10.1016","volume":"78","author":[{"given":"J.P.","family":"Warners","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Roos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"article-title":"A branch-and-cut algorithm for the frequency assignment problem","year":"1995","author":"Aardal","key":"10.1016\/S0166-218X(96)00139-4_BIB1"},{"article-title":"GRAPH: Generating Radio link frequency Assignment Problems Heuristically","year":"1995","author":"van Benthem","key":"10.1016\/S0166-218X(96)00139-4_BIB2"},{"article-title":"Frequency assignment in mobile telecommunication networks","year":"1992","author":"Bloemen","key":"10.1016\/S0166-218X(96)00139-4_BIB3"},{"key":"10.1016\/S0166-218X(96)00139-4_BIB4_1","first-page":"747","article-title":"Iterative solution of problems of linear and quadratic programming","volume":"174","author":"Dikin","year":"1967","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0166-218X(96)00139-4_BIB4_2","first-page":"674","volume":"8","author":"Dikin","year":"1967","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0166-218X(96)00139-4_BIB5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(95)00199-9","article-title":"Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid","volume":"94","author":"Flippo","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00139-4_BIB6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02283686","article-title":"Computational experience with an interior point algorithm on the satisfiability problem","volume":"25","author":"Kamath","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00139-4_BIB7","article-title":"Semidefinite programming and graph equipartition","volume":"5","author":"Karisch","year":"1995"},{"key":"10.1016\/S0166-218X(96)00139-4_BIB8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(96)00139-4_BIB9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/conm\/114\/1097880","article-title":"An interior-point approach to NP-complete problems-part I","volume":"114","author":"Karmarkar","year":"1990","journal-title":"Contemp. Math."},{"key":"10.1016\/S0166-218X(96)00139-4_BIB10","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF01582907","article-title":"An interior point algorithm to solve computationally difficult set covering problems","volume":"52","author":"Karmarkar","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(96)00139-4_BIB11_1","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"Khachiyan","year":"1979","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0166-218X(96)00139-4_BIB11_2","first-page":"191","volume":"20","author":"Khachiyan","year":"1979","journal-title":"Soviet Math. Dokl."},{"article-title":"Graph theory and radio frequency assignment","year":"1989","author":"Lanfear","key":"10.1016\/S0166-218X(96)00139-4_BIB12"},{"key":"10.1016\/S0166-218X(96)00139-4_BIB13","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","article-title":"The maximum clique problem","volume":"4","author":"Pardalos","year":"1994","journal-title":"J. Global Optim."},{"key":"10.1016\/S0166-218X(96)00139-4_BIB14","doi-asserted-by":"crossref","DOI":"10.1007\/BF02614438","article-title":"A semidefinite framework for trust region subproblems with application to large scale minimization","author":"Rendl","year":"1996"},{"key":"10.1016\/S0166-218X(96)00139-4_BIB15","first-page":"23","article-title":"An improvement on Karmarkar's algorithm for integer programming","volume":"21","author":"Shi","year":"1992","journal-title":"COAL Bull."},{"key":"10.1016\/S0166-218X(96)00139-4_BIB16","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0719026","article-title":"Newton's method with a model trust region modification","volume":"19","author":"S\u00f6rensen","year":"1982","journal-title":"SIAM J. Numer. Anal."},{"year":"1994","series-title":"Frequency assignment by local search, CALMA project","author":"Tiourine","key":"10.1016\/S0166-218X(96)00139-4_BIB17"},{"year":"1995","series-title":"An overview of algorithmic approaches to frequency assignment problems, CALMA project","author":"Tiourine","key":"10.1016\/S0166-218X(96)00139-4_BIB18"},{"article-title":"A potential reduction approach to the Radio Link Frequency Assignment Problem","year":"1995","author":"Warners","key":"10.1016\/S0166-218X(96)00139-4_BIB19"},{"key":"10.1016\/S0166-218X(96)00139-4_BIB20","doi-asserted-by":"crossref","DOI":"10.1016\/S0167-6377(97)00031-X","article-title":"Potential reduction algorithms for structured combinatorial optimization problems","author":"Warners","year":"1995"},{"key":"10.1016\/S0166-218X(96)00139-4_BIB21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01580903","article-title":"On affine scaling algorithms for nonconvex quadratic programming","volume":"56","author":"Ye","year":"1992","journal-title":"Math. Programming"},{"year":"1994","series-title":"LIPSOL \u2014 a MATLABTM toolkit for linear programming interior-point solvers","author":"Zhang","key":"10.1016\/S0166-218X(96)00139-4_BIB22"},{"key":"10.1016\/S0166-218X(96)00139-4_BIB23","unstructured":"FORTRAN subroutines written by E.G. Ng and B.W. Peyton (ORNL), J.W.H. Liu (Waterloo), and Y. Zhang (UMBC)."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001394?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96001394?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:26:40Z","timestamp":1556666800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96001394"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0166218X96001394"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00139-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}