{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T12:55:45Z","timestamp":1712062545689},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T00:00:00Z","timestamp":1519603200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10288-018-0373-7","type":"journal-article","created":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T06:28:24Z","timestamp":1519626504000},"page":"1-13","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Sweet sixteen"],"prefix":"10.1007","volume":"16","author":[{"given":"Yves","family":"Crama","sequence":"first","affiliation":[]},{"given":"Michel","family":"Grabisch","sequence":"additional","affiliation":[]},{"given":"Silvano","family":"Martello","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,26]]},"reference":[{"key":"373_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10288-014-0275-2","volume":"12","author":"S Amaran","year":"2014","unstructured":"Amaran S, Sahinidis N, Sharda B, Bury S (2014) Simulation optimization: a review of algorithms and applications. 4OR Q J Oper Res 12:301\u2013333","journal-title":"4OR Q J Oper Res"},{"issue":"1","key":"373_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-015-0292-9","volume":"14","author":"A Basu","year":"2016","unstructured":"Basu A, Hildebrand R, K\u00f6ppe M (2016a) Light on the infinite group relaxation I: foundations and taxonomy. 4OR Q J Oper Res 14(1):1\u201340","journal-title":"4OR Q J Oper Res"},{"issue":"2","key":"373_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10288-015-0293-8","volume":"14","author":"A Basu","year":"2016","unstructured":"Basu A, Hildebrand R, K\u00f6ppe M (2016b) Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms. 4OR Q J Oper Res 14(2):107\u2013131","journal-title":"4OR Q J Oper Res"},{"issue":"4","key":"373_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10288-016-0314-2","volume":"14","author":"SJL Billinge","year":"2016","unstructured":"Billinge SJL, Duxbury PM, Gon\u00e7alves DS, Lavor C, Mucherino A (2016) Assigned and unassigned distance geometry: applications to biological molecules and nanostructures. 4OR Q J Oper Res 14(4):337\u2013376","journal-title":"4OR Q J Oper Res"},{"issue":"1","key":"373_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10288-006-0087-0","volume":"4","author":"D Bouyssou","year":"2006","unstructured":"Bouyssou D, Martello S, Plastria F (2006) A case of plagiarism: D\u0103nu\u0163 Marcu. 4OR Q J Oper Res 4(1):11\u201313","journal-title":"4OR Q J Oper Res"},{"issue":"1","key":"373_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10288-009-0100-5","volume":"7","author":"D Bouyssou","year":"2009","unstructured":"Bouyssou D, Martello S, Plastria F (2009) Plagiarism again: Sreenivas and Srinivas, with an update on Marcu. 4OR Q J Oper Res 7(1):17\u201320","journal-title":"4OR Q J Oper Res"},{"key":"373_CR7","doi-asserted-by":"crossref","unstructured":"Bouyssou D, Martello S, Plastria F (eds) (2007) Surveys in operations research (invited surveys from 4OR) volume 153 of Annals of Operations Research. Springer, New York","DOI":"10.1007\/s10479-007-0168-2"},{"key":"373_CR8","doi-asserted-by":"crossref","unstructured":"Bouyssou D, Martello S, Plastria F (eds) (2010) Surveys in operations research II (invited surveys from 4OR, 2006\u20132008), volume 175 of Annals of Operations Research. Springer, New York,","DOI":"10.1007\/s10479-009-0671-8"},{"issue":"1","key":"373_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-017-0342-6","volume":"15","author":"BD Brouer","year":"2017","unstructured":"Brouer BD, Karsten ChV, Pisinger D (2017) Optimization in liner shipping. 4OR Q J Oper Res 15(1):1\u201335","journal-title":"4OR Q J Oper Res"},{"issue":"3","key":"373_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10288-016-0306-2","volume":"14","author":"D Cattaruzza","year":"2016","unstructured":"Cattaruzza D, Absi N, Feillet D (2016) Vehicle routing problems with multiple trips. 4OR Q J Oper Res 14(3):223\u2013259","journal-title":"4OR Q J Oper Res"},{"key":"373_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10288-014-0257-4","volume":"12","author":"P Chr\u00e9tienne","year":"2014","unstructured":"Chr\u00e9tienne P (2014) On scheduling with the non-idling constraint. 4OR Q J Oper Res 12:101\u2013121","journal-title":"4OR Q J Oper Res"},{"key":"373_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10288-016-0329-8","volume":"14","author":"Y Crama","year":"2016","unstructured":"Crama Y, Grabisch M, Martello S (2016) A brand new cheating attempt: a case of usurped identity. 4OR Q J Oper Res 14:333\u2013336","journal-title":"4OR Q J Oper Res"},{"key":"373_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10288-012-0198-8","volume":"10","author":"A Pia Del","year":"2012","unstructured":"Del Pia A, Weismantel R (2012) Relaxations of mixed integer sets from lattice-free polyhedra. 4OR Q J Oper Res 10:221\u2013244","journal-title":"4OR Q J Oper Res"},{"key":"373_CR14","doi-asserted-by":"crossref","unstructured":"Di Pillo G, Latorre V, Lucidi S, Procacci E (2016) An application of support vector machines to sales forecasting under promotions. 4OR Q J Oper Res 14 (3):309\u2013325","DOI":"10.1007\/s10288-016-0316-0"},{"issue":"3","key":"373_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10288-017-0350-6","volume":"15","author":"MA Goberna","year":"2017","unstructured":"Goberna MA, L\u00f3pez MA (2017) Recent contributions to linear semi-infinite optimization. 4OR Q J Oper Res 15(3):221\u2013264","journal-title":"4OR Q J Oper Res"},{"key":"373_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10288-011-0191-7","volume":"10","author":"Y Hamadi","year":"2012","unstructured":"Hamadi Y, Jabbour S, Sa\u00efs L (2012) Learning from conflicts in propositional satisfiability. 4OR Q J Oper Res 10:15\u201332","journal-title":"4OR Q J Oper Res"},{"key":"373_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10288-011-0180-x","volume":"10","author":"H Kellerer","year":"2012","unstructured":"Kellerer H, Strusevich VA (2012) The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR Q J Oper Res 10:111\u2013161","journal-title":"4OR Q J Oper Res"},{"key":"373_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-012-0213-0","volume":"11","author":"M Labb\u00e9","year":"2013","unstructured":"Labb\u00e9 M, Violin A (2013) Bilevel programming and price setting problems. 4OR Q J Oper Res 11:1\u201330","journal-title":"4OR Q J Oper Res"},{"key":"373_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10288-014-0262-7","volume":"12","author":"G Lancia","year":"2014","unstructured":"Lancia G, Serafini P (2014) Deriving compact extended formulations via LP-based separation techniques. 4OR Q J Oper Res 12:201\u2013234","journal-title":"4OR Q J Oper Res"},{"issue":"4","key":"373_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10288-015-0301-z","volume":"13","author":"G Laporte","year":"2015","unstructured":"Laporte G, Meunier F, Wolfler Calvo R (2015) Shared mobility systems. 4OR Q J Oper Res 13(4):341\u2013360","journal-title":"4OR Q J Oper Res"},{"key":"373_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-015-0283-x","volume":"13","author":"L Liberti","year":"2015","unstructured":"Liberti L, Marchant T, Martello S (2015) The dirty dozen of 4OR. 4OR Q J Oper Res 13:1\u201313","journal-title":"4OR Q J Oper Res"},{"key":"373_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-016-2205-5","volume":"240","author":"L Liberti","year":"2016","unstructured":"Liberti L, Marchant T, Martello S (2016b) Twelve surveys in operations research. Ann Oper Res 240:3\u201311","journal-title":"Ann Oper Res"},{"key":"373_CR23","doi-asserted-by":"crossref","unstructured":"Liberti L, Marchant T, Martello S (eds) (2013) Surveys in operations research III (invited surveys from 4OR, 2009\u20132011), volume 204 of Annals of Operations Research. Springer, New York","DOI":"10.1007\/s10479-013-1310-y"},{"key":"373_CR24","doi-asserted-by":"crossref","unstructured":"Liberti L, Marchant T, Martello S (eds) (2016a)Surveys in operations research IV (invited surveys from 4OR, 2012\u20132014), volume 240 of Annals of Operations Research. Springer, New York","DOI":"10.1007\/s10479-016-2205-5"},{"key":"373_CR25","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10288-013-0251-2","volume":"11","author":"M Locatelli","year":"2013","unstructured":"Locatelli M, Schoen F (2013) Global optimization based on local searches. 4OR Q J Oper Res 11:301\u2013321","journal-title":"4OR Q J Oper Res"},{"key":"373_CR26","unstructured":"McCook A (2016) A new way to fake authorship: submit under a prominent name, then say it was a mistake. Retractionwatch. http:\/\/retractionwatch.com\/2016\/11\/28\/new-way-fake-authorship-submit-prominent-name-say-mistake"},{"key":"373_CR27","unstructured":"Nogueira TH, de Carvalho CRV (2015) Mathematical model applied to single-track line scheduling problem in Brazilian railways. 4OR 13(4): 403\u2013441"},{"key":"373_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-014-0256-5","volume":"12","author":"M Pappalardo","year":"2014","unstructured":"Pappalardo M, Mastroeni G, Passacantando M (2014) Merit functions: a bridge between optimization and equilibria. 4OR Q J Oper Res 12:1\u201333","journal-title":"4OR Q J Oper Res"},{"issue":"3","key":"373_CR29","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10288-015-0294-7","volume":"13","author":"V Th Paschos","year":"2015","unstructured":"Paschos V Th (2015) When polynomial approximation meets exact computation. 4OR Q J Oper Res 13(3):227\u2013245","journal-title":"4OR Q J Oper Res"},{"key":"373_CR30","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10288-012-0210-3","volume":"10","author":"F Rendl","year":"2012","unstructured":"Rendl F (2012) Semidefinite relaxations for partitioning, assignment and ordering problems. 4OR Q J Oper Res 10:321\u2013346","journal-title":"4OR Q J Oper Res"},{"key":"373_CR31","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10288-013-0248-x","volume":"11","author":"C Segura","year":"2013","unstructured":"Segura C, Coello C, Miranda G, Le\u00f3n C (2013) Using multi-objective evolutionary algorithms for single-objective optimization. 4OR Q J Oper Res 11:201\u2013228","journal-title":"4OR Q J Oper Res"},{"issue":"3","key":"373_CR32","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10288-015-0280-0","volume":"13","author":"O Stan","year":"2015","unstructured":"Stan O, Carlier J, Sirdey R, Nace D (2015) A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures. 4OR Q J Oper Res 13(3):309\u2013334","journal-title":"4OR Q J Oper Res"},{"issue":"2","key":"373_CR33","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10288-014-0279-y","volume":"13","author":"M Tahanan","year":"2015","unstructured":"Tahanan M, van Ackooij W, Frangioni A, Lacalandra F (2015) Large-scale unit commitment under uncertainty. 4OR Q J Oper Res 13(2):115\u2013171","journal-title":"4OR Q J Oper Res"},{"key":"373_CR34","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10288-013-0242-3","volume":"11","author":"EG Talbi","year":"2013","unstructured":"Talbi EG (2013) Combining metaheuristics with mathematical programming, constraint programming and machine learning. 4OR Q J Oper Res 11:101\u2013150","journal-title":"4OR Q J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-018-0373-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0373-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0373-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T20:44:40Z","timestamp":1570826680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-018-0373-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,26]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["373"],"URL":"https:\/\/doi.org\/10.1007\/s10288-018-0373-7","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,26]]},"assertion":[{"value":"26 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}