{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:22:55Z","timestamp":1761895375444},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,10,26]],"date-time":"2011-10-26T00:00:00Z","timestamp":1319587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s11590-011-0416-x","type":"journal-article","created":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T09:57:28Z","timestamp":1319536648000},"page":"289-296","source":"Crossref","is-referenced-by-count":4,"title":["Finding cliques of maximum weight on a generalization of permutation graphs"],"prefix":"10.1007","volume":"7","author":[{"given":"Valentina","family":"Cacchiani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Caprara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,26]]},"reference":[{"key":"416_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of combinatorial optimization","author":"I.M. Bomze","year":"1999","unstructured":"Bomze I.M., Budinich M., Pardalos P.M., Pelillo M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds) Handbook of combinatorial optimization, pp. 1\u201374. Kluwer Academic Publishers, Boston (1999)"},{"key":"416_CR2","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/trsc.32.4.358","volume":"32","author":"U. Br\u00e4nnlund","year":"1998","unstructured":"Br\u00e4nnlund U., Lindberg P.O., N\u00f6u A., Nilsson J.E.: Allocation of scarce track capacity using Lagrangian relaxation. Transp. Sci. 32, 358\u2013369 (1998)","journal-title":"Transp. Sci."},{"key":"416_CR3","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.orl.2010.01.007","volume":"38","author":"V. Cacchiani","year":"2010","unstructured":"Cacchiani V., Caprara A., Toth P.: Non-cyclic train timetabling and comparability graphs. Oper. Res. Lett. 38, 179\u2013184 (2010)","journal-title":"Oper. Res. Lett."},{"key":"416_CR4","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs (2nd edn.). In: Annals of Discrete Mathematics, vol 57. Nort Holland Publishing, Amsterdam, The Netherlands (2004)","DOI":"10.1016\/S0167-5060(04)80059-1"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0416-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0416-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0416-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T15:22:08Z","timestamp":1560871328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0416-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,26]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["416"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0416-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,26]]}}}