{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:19:56Z","timestamp":1649099996984},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s43069-021-00111-x","type":"journal-article","created":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T10:07:09Z","timestamp":1638526029000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Clique Search Problem and its Application to Machine Scheduling"],"prefix":"10.1007","volume":"2","author":[{"given":"S\u00e1ndor","family":"Szab\u00f3","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,3]]},"reference":[{"key":"111_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"2003","unstructured":"Garey MR, Johnson DS (2003) Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York"},{"key":"111_CR2","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational Complexity. Addison-Wesley Publishing Company Inc, Reading, MA"},{"key":"111_CR3","doi-asserted-by":"crossref","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The Maximum Clique Problem, Handbook of Combinatorial Optimization, vol. 4. Kluwer Academic Publisher","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"111_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10878-012-9592-6","volume":"27","author":"M Batsyn","year":"2014","unstructured":"Batsyn M, Goldengorin M, Maslov E, Pardalos PM (2014) Improvements to MCS algorithm for the maximum clique problem. J Comb Optim 27:397\u2013416","journal-title":"J Comb Optim"},{"key":"111_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9:375\u2013382","journal-title":"Oper Res Lett"},{"key":"111_CR6","first-page":"569","volume":"58","author":"J Konc","year":"2007","unstructured":"Konc J, Jane\u017ei\u010d D (2007) An improved branch and bound algorithm for the maximum clique problem. MATCH Communications in Mathematical and Computer Chemistry 58:569\u2013590","journal-title":"MATCH Communications in Mathematical and Computer Chemistry"},{"key":"111_CR7","unstructured":"Kumlander\u00a0D (2004) A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search. Proc. 5th International Conference on Modeling, Computation and Optimization in Information Systems and Management Sciences. pp. 202\u2013208"},{"key":"111_CR8","unstructured":"Kumlander\u00a0D (2005) Some Practical Algorithms to Solve the Maximal Clique Problem, PhD. Thesis. Tallin University of Technology"},{"key":"111_CR9","first-page":"424","volume":"8","author":"PRJ \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd PRJ (2001) A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing 8:424\u2013436","journal-title":"Nordic Journal of Computing"},{"key":"111_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd PRJ (2002) A fast algorithm for the maximum clique problem. Discret Appl Math 120:197\u2013207","journal-title":"Discret Appl Math"},{"key":"111_CR11","doi-asserted-by":"crossref","unstructured":"San Segundo P, Tapia\u00a0C (2014)\u00a0Relaxed approximate coloring in exact maximum clique search.\u00a0Comput Oper Res\u00a044:185\u2013192","DOI":"10.1016\/j.cor.2013.10.018"},{"key":"111_CR12","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume":"2631","author":"E Tomita","year":"2003","unstructured":"Tomita E, Seki T (2003) An efficient branch-and-bound algorithm for finding a maximum clique. Lect Notes Comput Sci 2631:278\u2013289","journal-title":"Lect Notes Comput Sci"},{"key":"111_CR13","doi-asserted-by":"crossref","unstructured":"Hasselberg J, Pardalos PM, Vairaktarakis G (1993) Test case generators and computational results for the maximum clique problem.\u00a0J Glob Optim\u00a03:463\u2013482. http:\/\/www.springerlink.com\/content\/p2m65n57u657605n","DOI":"10.1007\/BF01096415"},{"key":"111_CR14","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E Balas","year":"1969","unstructured":"Balas E (1969) Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper Res 17:941\u2013957","journal-title":"Oper Res"},{"key":"111_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0166-218X(96)00040-6","volume":"72","author":"B Jurisch","year":"1997","unstructured":"Jurisch B, Kubiak W, J\u00f3zefowska J (1997) Algorithms for minclique scheduling problems. Discret Appl Math 72:115\u2013139","journal-title":"Discret Appl Math"},{"key":"111_CR16","first-page":"2557","volume":"48","author":"E Sanmart\u00ed","year":"2002","unstructured":"Sanmart\u00ed E, Puigjaner L, Holczinger T, Friedler F (2002) Combinatorial framework for effective scheduling of multipurpose batch plants. Process System Engineering 48:2557\u20132570","journal-title":"Process System Engineering"},{"key":"111_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.2307\/2005469","volume":"29","author":"DE Knuth","year":"1975","unstructured":"Knuth DE (1975) Estimating the efficiency of back tracking programs. Math of Comp 29:121\u2013131","journal-title":"Math of Comp"},{"key":"111_CR18","doi-asserted-by":"crossref","unstructured":"Butz L, Hammer PL, Haussmann D (1985) Reduction methods for the vertex packing problem, Proceedings of the 17th Conference on Probability Theory, Brassov, 1982.\u00a0VNU Science Press Utrecht, pp. 73\u201379","DOI":"10.1515\/9783112314036-010"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00111-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-021-00111-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00111-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T06:23:49Z","timestamp":1640586229000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-021-00111-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["111"],"URL":"https:\/\/doi.org\/10.1007\/s43069-021-00111-x","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"12 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no conflict of interest in connection with this material.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"69"}}