{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T16:29:10Z","timestamp":1707841750486},"reference-count":47,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100004412","name":"T\u00fcrkiye Bilimler Akademisi","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004412","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1016\/j.ejor.2020.09.017","type":"journal-article","created":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T02:26:17Z","timestamp":1600741577000},"page":"67-83","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs"],"prefix":"10.1016","volume":"291","author":[{"given":"Oylum","family":"\u015eeker","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5024-6186","authenticated-orcid":false,"given":"T\u0131naz","family":"Ekim","sequence":"additional","affiliation":[]},{"given":"Z. Caner","family":"Ta\u015fk\u0131n","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2020.09.017_bib0001","series-title":"Combinatorial optimization with interior point methods and semidefinite matrices","author":"Alizadeh","year":"1991"},{"key":"10.1016\/j.ejor.2020.09.017_bib0002","series-title":"Experimental and efficient algorithms","first-page":"302","article-title":"Generating and radiocoloring families of perfect graphs","author":"Andreou","year":"2005"},{"key":"10.1016\/j.ejor.2020.09.017_bib0003","series-title":"Graphs and hypergraphs","volume":"7","author":"Berge","year":"1973"},{"key":"10.1016\/j.ejor.2020.09.017_bib0004","first-page":"221","article-title":"A composition for perfect graphs","volume":"21","author":"Bixby","year":"1984","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/j.ejor.2020.09.017_bib0005","series-title":"Graph classes: A survey","volume":"3","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/j.ejor.2020.09.017_bib0006","series-title":"Progress in combinatorial optimization","first-page":"69","article-title":"Polynomial algorithm to recognize a Meyniel graph","author":"Burlet","year":"1984"},{"issue":"2","key":"10.1016\/j.ejor.2020.09.017_bib0007","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s00493-005-0012-8","article-title":"Recognizing Berge graphs","volume":"25","author":"Chudnovsky","year":"2005","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/j.ejor.2020.09.017_bib0008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.21688","article-title":"The structure of bull-free perfect graphs","volume":"74","author":"Chudnovsky","year":"2013","journal-title":"Journal of Graph Theory"},{"issue":"1","key":"10.1016\/j.ejor.2020.09.017_bib0009","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","article-title":"The strong perfect graph theorem","volume":"164","author":"Chudnovsky","year":"2006","journal-title":"Annals of Mathematics"},{"key":"10.1016\/j.ejor.2020.09.017_bib0010","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/B978-0-12-566780-7.50012-X","article-title":"Notes on perfect graphs","author":"Chv\u00e1tal","year":"1984","journal-title":"Progress in Combinatorial Optimization"},{"issue":"3","key":"10.1016\/j.ejor.2020.09.017_bib0011","doi-asserted-by":"crossref","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","article-title":"A combinatorial decomposition theory","volume":"32","author":"Cunningham","year":"1980","journal-title":"Canadian Journal of Mathematics"},{"issue":"2","key":"10.1016\/j.ejor.2020.09.017_bib0012","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.ejor.2014.05.011","article-title":"On some applications of the selective graph coloring problem","volume":"240","author":"Demange","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2020.09.017_bib0013","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publicationes Mathematicae Debrecen"},{"issue":"3","key":"10.1016\/j.ejor.2020.09.017_bib0014","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1002\/net.20365","article-title":"A branch-and-cut algorithm for partition coloring","volume":"55","author":"Frota","year":"2010","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2020.09.017_bib0015","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.cor.2017.12.019","article-title":"An exact algorithm for the partition coloring problem","volume":"92","author":"Furini","year":"2018","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2020.09.017_bib0016","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.disopt.2017.04.001","article-title":"On the lov\u00e1sz theta function and some variants","volume":"25","author":"Galli","year":"2017","journal-title":"Discrete Optimization"},{"key":"10.1016\/j.ejor.2020.09.017_bib0017","series-title":"Algorithmic graph theory and perfect graphs","volume":"57","author":"Golumbic","year":"2004"},{"issue":"2","key":"10.1016\/j.ejor.2020.09.017_bib0018","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/j.ejor.2020.09.017_bib0019","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0304-0208(08)72943-8","article-title":"Polynomial algorithms for perfect graphs","volume":"88","author":"Gr\u00f6tschel","year":"1984","journal-title":"North-Holland Mathematics Studies"},{"key":"10.1016\/j.ejor.2020.09.017_bib0020","series-title":"Geometric algorithms and combinatorial optimization","author":"Gr\u00f6tschel","year":"1988"},{"issue":"12","key":"10.1016\/j.ejor.2020.09.017_bib0021","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":"Proceedings of the IEEE"},{"issue":"4","key":"10.1016\/j.ejor.2020.09.017_bib0022","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s12532-012-0042-3","article-title":"Maximum-weight stable sets and safe lower bounds for graph coloring","volume":"4","author":"Held","year":"2012","journal-title":"Mathematical Programming Computation"},{"issue":"2","key":"10.1016\/j.ejor.2020.09.017_bib0023","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.orl.2011.02.006","article-title":"A branch-and-price approach for the partition coloring problem","volume":"39","author":"Hoshino","year":"2011","journal-title":"Operations Research Letters"},{"issue":"19\u201320","key":"10.1016\/j.ejor.2020.09.017_bib0024","doi-asserted-by":"crossref","first-page":"2529","DOI":"10.1016\/j.disc.2006.05.021","article-title":"Classes of perfect graphs","volume":"306","author":"Hougardy","year":"2006","journal-title":"Discrete Mathematics"},{"issue":"1","key":"10.1016\/j.ejor.2020.09.017_bib0025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1193","article-title":"The sandwich theorem","volume":"1","author":"Knuth","year":"1994","journal-title":"The Electronic Journal of Combinatorics"},{"key":"10.1016\/j.ejor.2020.09.017_bib0026","series-title":"A guide to graph colouring","author":"Lewis","year":"2015"},{"key":"10.1016\/j.ejor.2020.09.017_bib0027","series-title":"Proceedings of the first workshop on optical networks","article-title":"The partition coloring problem and its application to wavelength routing and assignment","author":"Li","year":"2000"},{"issue":"3","key":"10.1016\/j.ejor.2020.09.017_bib0028","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Mathematics"},{"issue":"1","key":"10.1016\/j.ejor.2020.09.017_bib0029","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of a graph","volume":"25","author":"Lov\u00e1sz","year":"1979","journal-title":"IEEE Transactions on Information theory"},{"issue":"1","key":"10.1016\/j.ejor.2020.09.017_bib0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00696.x","article-title":"A survey on vertex coloring problems","volume":"17","author":"Malaguti","year":"2010","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2020.09.017_bib0031","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10479-007-0190-4","article-title":"Two methods for the generation of chordal graphs","volume":"157","author":"Markenzon","year":"2008","journal-title":"Annals of Operations Research"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2020.09.017_bib0032","first-page":"11","article-title":"Graph colouring problems and their applications in scheduling","volume":"48","author":"Marx","year":"2004","journal-title":"Periodica Polytechnica Electrical Engineering"},{"key":"10.1016\/j.ejor.2020.09.017_bib0033","article-title":"Random perfect graphs","author":"McDiarmid","year":"2016","journal-title":"Random Structures & Algorithms"},{"key":"10.1016\/j.ejor.2020.09.017_bib0034","unstructured":"McKay, B. (2016). Graphs. http:\/\/users.cecs.anu.edu.au\/~bdm\/data\/graphs.html Accessed 25 December 2017."},{"issue":"4","key":"10.1016\/j.ejor.2020.09.017_bib0035","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","article-title":"A column generation approach for graph coloring","volume":"8","author":"Mehrotra","year":"1996","journal-title":"INFORMS Journal on Computing"},{"issue":"5","key":"10.1016\/j.ejor.2020.09.017_bib0036","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1016\/j.dam.2005.05.022","article-title":"A branch-and-cut algorithm for graph coloring","volume":"154","author":"M\u00e9ndez-D\u00edaz","year":"2006","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2020.09.017_bib0037","unstructured":"Mittelmann, H. (2018). Benchmarks for optimization software. http:\/\/plato.asu.edu\/bench.html"},{"key":"10.1016\/j.ejor.2020.09.017_bib0038","series-title":"Interior-point polynomial algorithms in convex programming","volume":"13","author":"Nesterov","year":"1994"},{"issue":"20","key":"10.1016\/j.ejor.2020.09.017_bib0039","doi-asserted-by":"crossref","first-page":"6092","DOI":"10.1016\/j.disc.2009.05.024","article-title":"The strong perfect graph conjecture: 40 years of attempts, and its resolution","volume":"309","author":"Roussel","year":"2009","journal-title":"Discrete Mathematics"},{"issue":"2","key":"10.1016\/j.ejor.2020.09.017_bib0040","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.21850","article-title":"A decomposition approach to solve the selective graph coloring problem in some perfect graph families","volume":"73","author":"\u015eeker","year":"2019","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2020.09.017_bib0041","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/978-3-319-57586-5_37","article-title":"Linear-time generation of random chordal graphs","volume":"10236","author":"\u015eeker","year":"2017"},{"issue":"10","key":"10.1016\/j.ejor.2020.09.017_bib0042","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","article-title":"Improving discrete model representations via symmetry considerations","volume":"47","author":"Sherali","year":"2001","journal-title":"Management Science"},{"key":"10.1016\/j.ejor.2020.09.017_bib0043","series-title":"Efficient graph representations","author":"Spinrad","year":"2003"},{"issue":"1","key":"10.1016\/j.ejor.2020.09.017_bib0044","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","article-title":"An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments","volume":"37","author":"Tomita","year":"2007","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.ejor.2020.09.017_bib0045","series-title":"International workshop on algorithms and computation","first-page":"191","article-title":"A simple and faster branch-and-bound algorithm for finding a maximum clique","author":"Tomita","year":"2010"},{"issue":"3","key":"10.1016\/j.ejor.2020.09.017_bib0046","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","article-title":"A review on algorithms for maximum clique problems","volume":"242","author":"Wu","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"2\u20133","key":"10.1016\/j.ejor.2020.09.017_bib0047","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10589-005-3060-5","article-title":"On extracting maximum stable sets in perfect graphs using Lov\u00e1sz\u2019s theta function","volume":"33","author":"Y\u0131ld\u0131r\u0131m","year":"2006","journal-title":"Computational Optimization and Applications"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221720308031?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221720308031?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T17:33:40Z","timestamp":1696700020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221720308031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["S0377221720308031"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2020.09.017","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2021,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2020.09.017","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}