{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T14:34:24Z","timestamp":1724855664650},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100004410","name":"Scientific and Technological Research Council of Turkey","doi-asserted-by":"publisher","award":["215M844"],"id":[{"id":"10.13039\/501100004410","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":[[2020,7]]},"DOI":"10.1016\/j.ejor.2020.01.001","type":"journal-article","created":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T13:33:15Z","timestamp":1578403995000},"page":"632-643","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Distribution based representative sets for multi-objective integer programs"],"prefix":"10.1016","volume":"284","author":[{"given":"Sami Serkan","family":"\u00d6zar\u0131k","sequence":"first","affiliation":[]},{"given":"Banu","family":"Lokman","sequence":"additional","affiliation":[]},{"given":"Murat","family":"K\u00f6ksalan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ejor.2020.01.001_bib0001","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1287\/ijoc.2017.0804","article-title":"Disjunctive programming for multiobjective discrete optimisation","volume":"30","author":"Bekta\u015f","year":"2018","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.001_bib0002","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1016\/j.ejor.2016.02.037","article-title":"A new method for optimizing a linear function over the efficient set of a multiobjective integer program","volume":"260","author":"Boland","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.001_bib0003","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ejor.2018.06.012","article-title":"Finding a representative nondominated set for multi-objective mixed integer programs","volume":"272","author":"Ceyhan","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2020.01.001_bib0004","series-title":"Proceedings of the international conference on evolutionary multi-criterion optimization","first-page":"282","article-title":"Moped: a multi-objective parzen-based estimation of distribution algorithm for continuous problems","author":"Costa","year":"2003"},{"issue":"4","key":"10.1016\/j.ejor.2020.01.001_bib0005","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/s10898-014-0205-z","article-title":"A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems","volume":"61","author":"D\u00e4chert","year":"2015","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.001_bib0006","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.ejor.2016.05.029","article-title":"Efficient computation of the search region in multi-objective optimization","volume":"260","author":"D\u00e4chert","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.001_bib0007","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ejor.2008.12.034","article-title":"K-ppm: A new exact method to solve multi-objective combinatorial optimization problems","volume":"200","author":"Dhaenens","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2020.01.001_bib0008","series-title":"Pattern classification","author":"Duda","year":"1973"},{"key":"10.1016\/j.ejor.2020.01.001_bib0009","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","article-title":"A survey and annotated bibliography of multiobjective combinatorial optimization","volume":"22","author":"Ehrgott","year":"2000","journal-title":"OR Spektrum"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.001_bib0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02578918","article-title":"Approximative solution methods for multiobjective combinatorial optimization","volume":"12","author":"Ehrgott","year":"2004","journal-title":"Top"},{"key":"10.1016\/j.ejor.2020.01.001_bib0011","series-title":"Multiple criteria decision analysis","first-page":"817","article-title":"Exact methods for multi-objective combinatorial optimisation","author":"Ehrgott","year":"2016"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.001_bib0012","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s11081-009-9099-x","article-title":"On the quality of discrete representations in multiple objective programming","volume":"11","author":"Faulkenberg","year":"2010","journal-title":"Optimization and Engineering"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2020.01.001_bib0013","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1002\/mcda.1574","article-title":"Easy to say they are hard, but hard to see they are easy\u2014towards a categorization of tractable multiobjective combinatorial optimization problems","volume":"24","author":"Figueira","year":"2017","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.001_bib0014","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1287\/opre.1080.0581","article-title":"Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making","volume":"57","author":"Karasakal","year":"2009","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.001_bib0015","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2013.08.001","article-title":"A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems","volume":"232","author":"Kirlik","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2020.01.001_bib0016","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/nav.20336","article-title":"Approximating the nondominated frontiers of multi-objective combinatorial optimization problems","volume":"56","author":"K\u00f6ksalan","year":"2009","journal-title":"Naval Research Logistics (NRL)"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.001_bib0017","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10898-014-0212-0","article-title":"Finding nadir points in multi-objective integer programs","volume":"62","author":"K\u00f6ksalan","year":"2015","journal-title":"Journal of Global Optimization"},{"issue":"7","key":"10.1016\/j.ejor.2020.01.001_bib0018","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1002\/(SICI)1520-6750(199910)46:7<777::AID-NAV2>3.0.CO;2-5","article-title":"A heuristic approach to bicriteria scheduling","volume":"46","author":"K\u00f6ksalan","year":"1999","journal-title":"Naval Research Logistics (NRL)"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.001_bib0019","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1016\/j.ejor.2004.08.029","article-title":"An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method","volume":"169","author":"Laumanns","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2020.01.001_bib0020","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10898-012-9955-7","article-title":"Finding all nondominated points of multi-objective integer programs","volume":"57","author":"Lokman","year":"2013","journal-title":"Journal of Global Optimization"},{"issue":"11","key":"10.1016\/j.ejor.2020.01.001_bib0021","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1080\/0740817X.2014.882532","article-title":"Finding highly preferred points for multi-objective integer programs","volume":"46","author":"Lokman","year":"2014","journal-title":"IIE Transactions"},{"issue":"2","key":"10.1016\/j.ejor.2020.01.001_bib0022","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1287\/opre.1070.0413","article-title":"Diversity maximization approach for multiobjective optimization","volume":"56","author":"Masin","year":"2008","journal-title":"Operations Research"},{"issue":"18","key":"10.1016\/j.ejor.2020.01.001_bib0023","doi-asserted-by":"crossref","first-page":"9652","DOI":"10.1016\/j.amc.2013.03.002","article-title":"An improved version of the augmented \u03b5-constraint method (augmecon2) for finding the exact Pareto set in multi-objective integer programming problems","volume":"219","author":"Mavrotas","year":"2013","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.001_bib0024","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ejor.2008.10.023","article-title":"Multi-objective integer programming: A general approach for generating all non-dominated solutions","volume":"199","author":"\u00d6zlen","year":"2009","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2020.01.001_bib0025","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/s10957-013-0364-y","article-title":"Multi-objective integer programming: An improved recursive algorithm","volume":"160","author":"\u00d6zlen","year":"2014","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.001_bib0026","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","article-title":"On estimation of a probability density function and mode","volume":"33","author":"Parzen","year":"1962","journal-title":"The annals of mathematical statistics"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.001_bib0027","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.disopt.2010.03.005","article-title":"A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives","volume":"7","author":"Przybylski","year":"2010","journal-title":"Discrete Optimization"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.001_bib0028","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s101070050128","article-title":"Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming","volume":"87","author":"Say\u0131n","year":"2000","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.001_bib0029","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/S0377-2217(03)00255-8","article-title":"A method for finding the set of non-dominated vectors for multiple objective integer linear programs","volume":"158","author":"Sylva","year":"2004","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.001_bib0030","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.ejor.2006.02.049","article-title":"A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs","volume":"180","author":"Sylva","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2020.01.001_bib0031","series-title":"Advances in neural information processing systems","first-page":"849","article-title":"Manifold parzen windows","author":"Vincent","year":"2003"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221720300011?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221720300011?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T18:39:14Z","timestamp":1665081554000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221720300011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["S0377221720300011"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2020.01.001","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2020,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Distribution based representative sets for multi-objective integer programs","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.01.001","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"}]}}