{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T12:53:59Z","timestamp":1712062439832},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"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":[[2015,3]]},"DOI":"10.1007\/s10288-015-0283-x","type":"journal-article","created":{"date-parts":[[2015,3,14]],"date-time":"2015-03-14T08:42:36Z","timestamp":1426322556000},"page":"1-13","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The dirty dozen of 4OR"],"prefix":"10.1007","volume":"13","author":[{"given":"Leo","family":"Liberti","sequence":"first","affiliation":[]},{"given":"Thierry","family":"Marchant","sequence":"additional","affiliation":[]},{"given":"Silvano","family":"Martello","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,15]]},"reference":[{"key":"283_CR1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10288-009-0113-0","volume":"7","author":"A Alt\u0131n","year":"2009","unstructured":"Alt\u0131n A, Fortz B, Thorup M, \u00dcmit H (2009) Intra-domain traffic engineering with shortest path routing protocols. 4OR Q J Oper Res 7:301\u2013335","journal-title":"4OR Q J Oper Res"},{"key":"283_CR2","doi-asserted-by":"crossref","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"},{"key":"283_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10288-011-0172-x","volume":"9","author":"J Bennell","year":"2011","unstructured":"Bennell J, Mesgarpour M, Potts C (2011) Airport runway scheduling. 4OR Q J Oper Res 9:115\u2013138","journal-title":"4OR Q J Oper Res"},{"issue":"1","key":"283_CR4","doi-asserted-by":"crossref","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 4(1):11\u201313","journal-title":"4OR"},{"key":"283_CR5","volume-title":"Surveys in operations research (Invited surveys from 4OR), volume 153 of Annals of Operations Research","year":"2007","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"},{"issue":"1","key":"283_CR6","doi-asserted-by":"crossref","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 7(1):17\u201320","journal-title":"4OR"},{"key":"283_CR7","volume-title":"Surveys in operations research II (Invited surveys from 4OR, 2006\u20132008), volume 175 of Annals of Operations Research","year":"2010","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"},{"key":"283_CR8","doi-asserted-by":"crossref","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":"283_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10288-010-0122-z","volume":"8","author":"M Conforti","year":"2010","unstructured":"Conforti M, Cornu\u00e9jols G, Zambelli G (2010) Extended formulations in combinatorial optimization. 4OR Q J Oper Res 8:1\u201348","journal-title":"4OR Q J Oper Res"},{"key":"283_CR10","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10288-011-0181-9","volume":"9","author":"C D\u2019Ambrosio","year":"2011","unstructured":"D\u2019Ambrosio C, Lodi A (2011) Mixed integer nonlinear programming tools: a practical overview. 4OR Q J Oper Res 9:329\u2013349","journal-title":"4OR Q J Oper Res"},{"key":"283_CR11","doi-asserted-by":"crossref","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":"283_CR12","first-page":"480","volume":"515","author":"C Ferguson","year":"2014","unstructured":"Ferguson C, Marcus A, Oransky I (2014) The peer review scam. Science 515:480\u2013481","journal-title":"Science"},{"key":"283_CR13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10288-009-0109-9","volume":"7","author":"M Grabisch","year":"2009","unstructured":"Grabisch M (2009) The core of games on ordered structures and graphs. 4OR Q J Oper Res 7:207\u2013238","journal-title":"4OR Q J Oper Res"},{"key":"283_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10288-009-0101-4","volume":"7","author":"S Gualandi","year":"2009","unstructured":"Gualandi S, Malucelli F (2009) Constraint programming-based column generation. 4OR Q J Oper Res 7:113\u2013137","journal-title":"4OR Q J Oper Res"},{"key":"283_CR15","doi-asserted-by":"crossref","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":"283_CR16","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-010-0144-6","volume":"8","author":"H Hashimoto","year":"2010","unstructured":"Hashimoto H, Yagiura M, Imahori S, Ibaraki T (2010) Recent progress of local search in handling the time window constraints of the vehicle routing problem. 4OR Q J Oper Res 8:221\u2013238","journal-title":"4OR Q J Oper Res"},{"key":"283_CR17","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1126\/science.342.6162.1035","volume":"342","author":"M Hvistendahl","year":"2013","unstructured":"Hvistendahl M (2013) China\u2019s publication bazaar. Science 342:1035\u20131039","journal-title":"Science"},{"key":"283_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10288-011-0159-7","volume":"9","author":"F Jensen","year":"2011","unstructured":"Jensen F, Nielsen T (2011) Probabilistic decision graphs for optimization under uncertainty. 4OR Q J Oper Res 9:1\u201328","journal-title":"4OR Q J Oper Res"},{"key":"283_CR19","doi-asserted-by":"crossref","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":"283_CR20","doi-asserted-by":"crossref","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":"283_CR21","doi-asserted-by":"crossref","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"},{"key":"283_CR22","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10288-010-0149-1","volume":"8","author":"K Lee","year":"2010","unstructured":"Lee K, Leung J, Pinedo M (2010) Makespan minimization in online scheduling with machine eligibility. 4OR Q J Oper Res 8:331\u2013364","journal-title":"4OR Q J Oper Res"},{"issue":"1","key":"283_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10288-012-0200-5","volume":"10","author":"L Liberti","year":"2012","unstructured":"Liberti L, Marchant T, Martello S (2012) No end of the world in 2012 for 4OR. 4OR 10(1):1\u201313","journal-title":"4OR"},{"key":"283_CR24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-013-1310-y","volume":"204","author":"L Liberti","year":"2013","unstructured":"Liberti L, Marchant T, Martello S (2013a) Eleven surveys in operations research: III. Ann Oper Res 204:3\u20139","journal-title":"Ann Oper Res"},{"key":"283_CR25","volume-title":"Surveys in operations research III (Invited surveys from 4OR, 2009\u20132011), volume 204 of Annals of Operations Research","year":"2013","unstructured":"Liberti L, Marchant T, Martello S (eds) (2013b) Surveys in operations research III (Invited surveys from 4OR, 2009\u20132011), volume 204 of Annals of Operations Research. Springer, New York"},{"key":"283_CR26","doi-asserted-by":"crossref","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"},{"issue":"1","key":"283_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro\/2010001","volume":"44","author":"P Mahey","year":"2010","unstructured":"Mahey P (2010) A case of plagiarism: retraction of a paper by Sreenivas and Srinivas. RAIRO Oper Res 44(1):1\u20133","journal-title":"RAIRO Oper Res"},{"key":"283_CR28","doi-asserted-by":"crossref","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"},{"key":"283_CR29","doi-asserted-by":"crossref","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":"283_CR30","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10288-011-0177-5","volume":"9","author":"F Ricca","year":"2011","unstructured":"Ricca F, Scozzari A, Simeone B (2011) Political districting: from classical models to recent approaches. 4OR Q J Oper Res 9:223\u2013254","journal-title":"4OR Q J Oper Res"},{"key":"283_CR31","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10288-010-0125-9","volume":"8","author":"M Scutell\u00e0","year":"2010","unstructured":"Scutell\u00e0 M, Recchia R (2010) Robust portfolio asset allocation and risk measures. 4OR Q J Oper Res 8:113\u2013139","journal-title":"4OR Q J Oper Res"},{"key":"283_CR32","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10288-013-0248-x","volume":"11","author":"C Segura","year":"2013","unstructured":"Segura C, Coello 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":"283_CR33","first-page":"293","volume":"XVI","author":"A Soifer","year":"2007","unstructured":"Soifer A (2007) The case of Dr. D\u01cenu\u0163 Marcu: serial plagiarism and signing false statements. Geombinatorics XVI(3):293\u2013296","journal-title":"Geombinatorics"},{"key":"283_CR34","doi-asserted-by":"crossref","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\/content\/pdf\/10.1007\/s10288-015-0283-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-015-0283-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-015-0283-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:59Z","timestamp":1559131979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-015-0283-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["283"],"URL":"https:\/\/doi.org\/10.1007\/s10288-015-0283-x","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3]]}}}