Finding a representative nondominated set for multi-objective mixed integer programs
•Representative sets are found for multi-objective mixed integer programs.•A desired level of quality is guaranteed in representing the nondominated frontier.•The methods are computationally efficient based on extensive computational tests. In this paper, we develop algorithms to find small represen...
Uložené v:
| Vydané v: | European journal of operational research Ročník 272; číslo 1; s. 61 - 77 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.01.2019
|
| Predmet: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •Representative sets are found for multi-objective mixed integer programs.•A desired level of quality is guaranteed in representing the nondominated frontier.•The methods are computationally efficient based on extensive computational tests.
In this paper, we develop algorithms to find small representative sets of nondominated points that are well spread over the nondominated frontiers for multi-objective mixed integer programs. We evaluate the quality of representations of the sets by a Tchebycheff distance-based coverage gap measure. The first algorithm aims to substantially improve the computational efficiency of an existing algorithm that is designed to continue generating new points until the decision maker (DM) finds the generated set satisfactory. The algorithm improves the coverage gap value in each iteration by including the worst represented point into the set. The second algorithm, on the other hand, guarantees to achieve a desired coverage gap value imposed by the DM at the outset. In generating a new point, the algorithm constructs territories around the previously generated points that are inadmissible for the new point based on the desired coverage gap value. The third algorithm brings a holistic approach considering the solution space and the number of representative points that will be generated together. The algorithm first approximates the nondominated set by a hypersurface and uses it to plan the locations of the representative points. We conduct computational experiments on randomly generated instances of multi-objective knapsack, assignment, and mixed integer knapsack problems and show that the algorithms work well. |
|---|---|
| AbstractList | •Representative sets are found for multi-objective mixed integer programs.•A desired level of quality is guaranteed in representing the nondominated frontier.•The methods are computationally efficient based on extensive computational tests.
In this paper, we develop algorithms to find small representative sets of nondominated points that are well spread over the nondominated frontiers for multi-objective mixed integer programs. We evaluate the quality of representations of the sets by a Tchebycheff distance-based coverage gap measure. The first algorithm aims to substantially improve the computational efficiency of an existing algorithm that is designed to continue generating new points until the decision maker (DM) finds the generated set satisfactory. The algorithm improves the coverage gap value in each iteration by including the worst represented point into the set. The second algorithm, on the other hand, guarantees to achieve a desired coverage gap value imposed by the DM at the outset. In generating a new point, the algorithm constructs territories around the previously generated points that are inadmissible for the new point based on the desired coverage gap value. The third algorithm brings a holistic approach considering the solution space and the number of representative points that will be generated together. The algorithm first approximates the nondominated set by a hypersurface and uses it to plan the locations of the representative points. We conduct computational experiments on randomly generated instances of multi-objective knapsack, assignment, and mixed integer knapsack problems and show that the algorithms work well. |
| Author | Köksalan, Murat Ceyhan, Gökhan Lokman, Banu |
| Author_xml | – sequence: 1 givenname: Gökhan surname: Ceyhan fullname: Ceyhan, Gökhan – sequence: 2 givenname: Murat surname: Köksalan fullname: Köksalan, Murat – sequence: 3 givenname: Banu orcidid: 0000-0002-6664-9430 surname: Lokman fullname: Lokman, Banu email: lbanu@metu.edu.tr |
| BookMark | eNp9kLFOwzAQhi1UJNrCCzDlBRLOTuM4EguqKCBVYimz5TjnylFjV7ap4O1JKBNDpxvuvv_0fwsyc94hIfcUCgqUP_QF9j4UDKgogBdA2RWZU1GznAsOMzKHsq5zxmh9QxYx9gBAK1rNyW5jXWfdPlNZwGPAiC6pZE-YjR86P1inEnZZxJQZH7Lh85Bs7tse9e_RYL_GrXUJ9xiyY_D7oIZ4S66NOkS8-5tL8rF53q1f8-37y9v6aZvrFTQpN40xotFcCIMUeNuWhmnDa0GV4RoMVqbUplG6Y8C1EbqlolFcmFqXCutVuSTsnKuDjzGgkcdgBxW-JQU5eZG9nLzIyYsELkcvIyT-QdpOlb1LQdnDZfTxjOJY6mQxyKgtOo2dDaMQ2Xl7Cf8BoP2D7Q |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2024_04_026 crossref_primary_10_1007_s10479_020_03613_9 crossref_primary_10_1111_itor_70079 crossref_primary_10_1007_s00186_024_00870_3 crossref_primary_10_1007_s10287_023_00442_6 crossref_primary_10_1016_j_cor_2024_106928 crossref_primary_10_1016_j_ejor_2021_04_005 crossref_primary_10_1016_j_eswa_2020_113563 crossref_primary_10_1016_j_ejor_2025_06_012 crossref_primary_10_1016_j_cor_2021_105298 crossref_primary_10_1016_j_ejor_2020_01_001 crossref_primary_10_1287_mnsc_2023_4712 crossref_primary_10_1016_j_ejor_2019_11_017 crossref_primary_10_1016_j_cor_2021_105673 crossref_primary_10_1016_j_ins_2021_02_074 crossref_primary_10_1016_j_ejor_2022_07_044 crossref_primary_10_1007_s00500_023_08839_w crossref_primary_10_1007_s10589_024_00627_y crossref_primary_10_1080_0305215X_2021_1939695 |
| Cites_doi | 10.1016/S0377-2217(03)00255-8 10.1007/s10957-013-0364-y 10.1016/j.ejor.2013.08.001 10.1007/s10898-014-0205-z 10.1287/opre.1080.0581 10.1016/j.ejor.2006.02.049 10.1016/j.cor.2005.09.014 10.1287/opre.1070.0413 10.1016/0377-2217(86)90050-0 10.1007/s10898-012-9955-7 10.1007/BF02578918 10.1016/j.ejor.2015.03.031 10.1016/j.ejor.2004.08.029 10.1007/s002910000046 10.1002/nav.20336 10.1016/j.ejor.2008.10.023 10.1287/ijoc.1090.0342 10.1016/j.ejor.2006.12.054 10.1287/mnsc.1100.1248 10.1007/s12532-015-0093-3 10.1016/j.ejor.2008.12.034 10.1080/0740817X.2014.882532 10.1016/j.ejor.2016.03.035 10.1002/(SICI)1520-6750(199910)46:7<777::AID-NAV2>3.0.CO;2-5 10.1007/s101070050128 10.1109/TEVC.2003.810758 10.1287/opre.51.3.427.14951 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier B.V. |
| Copyright_xml | – notice: 2018 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2018.06.012 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 77 |
| ExternalDocumentID | 10_1016_j_ejor_2018_06_012 S0377221718305356 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c409t-f9ff89c688fe106bb3f2cf6781af6c0fe5f3cf9acd206cf8cb189a68f7c3ae743 |
| ISICitedReferencesCount | 21 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000447084800006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Tue Nov 18 22:39:05 EST 2025 Sat Nov 29 05:34:36 EST 2025 Fri Feb 23 02:27:37 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Mixed integer programming Representative subset Nondominated point Multiple objective programming |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c409t-f9ff89c688fe106bb3f2cf6781af6c0fe5f3cf9acd206cf8cb189a68f7c3ae743 |
| ORCID | 0000-0002-6664-9430 |
| OpenAccessLink | https://hdl.handle.net/11511/30626 |
| PageCount | 17 |
| ParticipantIDs | crossref_primary_10_1016_j_ejor_2018_06_012 crossref_citationtrail_10_1016_j_ejor_2018_06_012 elsevier_sciencedirect_doi_10_1016_j_ejor_2018_06_012 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-01-01 2019-01-00 |
| PublicationDateYYYYMMDD | 2019-01-01 |
| PublicationDate_xml | – month: 01 year: 2019 text: 2019-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2019 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Ehrgott, Gandibleux (bib0006) 2000; 22 Lokman, Köksalan (bib0018) 2013; 57 Sayın (bib0026) 2000; 87 Zitzler, Thiele, Laumanns, Fonseca, Grunert Da Fonseca (bib0030) 2003; 7 Korhonen, Laakso (bib0014) 1986; 24 Delort, Spanjaard (bib0004) 2010 Klamroth, Lacour, Vanderpooten (bib0011) 2015; 245 Dhaenens, Lemesre, Talbi (bib0005) 2010; 200 Laumanns, Thiele, Zitzler (bib0015) 2005 Masin, Bukchin (bib0020) 2008; 56 Boland, Charkhgard, Savelsbergh (bib0001) 2016; 8 Özlen, Azizoğlu (bib0021) 2009; 199 Köksalan, Lokman (bib0013) 2009; 56 Laumanns, Thiele, Zitzler (bib0016) 2006; 169 Lokman, Köksalan (bib0019) 2014; 46 Ozlen, Burton, MacRae (bib0022) 2014; 160 Lemesre, Dhaenens, Talbi (bib0017) 2007; 34 Sylva, Crema (bib0028) 2004; 158 Köksalan (bib0012) 1999; 46 Sylva, Crema (bib0029) 2007; 180 Kirlik, Sayın (bib0010) 2014; 232 Ehrgott, Gandibleux (bib0007) 2004; 12 Przybylski, Gandibleux, Ehrgott (bib0024) 2008; 185 Karasakal, Köksalan (bib0009) 2009; 57 Sayın (bib0027) 2003; 51 Ehrgott, Gandibleux (bib0008) 2008; 114 Boland, Charkhgard, Savelsbergh (bib0002) 2017; 260 Dächert, Klamroth (bib0003) 2015; 61 Przybylski, Gandibleux, Ehrgott (bib0025) 2010; 22 Özpeynirci, Köksalan (bib0023) 2010; 56 Sayın (10.1016/j.ejor.2018.06.012_bib0026) 2000; 87 Köksalan (10.1016/j.ejor.2018.06.012_bib0012) 1999; 46 Dhaenens (10.1016/j.ejor.2018.06.012_bib0005) 2010; 200 Ehrgott (10.1016/j.ejor.2018.06.012_bib0008) 2008; 114 Özlen (10.1016/j.ejor.2018.06.012_bib0021) 2009; 199 Dächert (10.1016/j.ejor.2018.06.012_bib0003) 2015; 61 Ozlen (10.1016/j.ejor.2018.06.012_bib0022) 2014; 160 Ehrgott (10.1016/j.ejor.2018.06.012_bib0006) 2000; 22 Lemesre (10.1016/j.ejor.2018.06.012_bib0017) 2007; 34 Laumanns (10.1016/j.ejor.2018.06.012_bib0016) 2006; 169 Sayın (10.1016/j.ejor.2018.06.012_bib0027) 2003; 51 Karasakal (10.1016/j.ejor.2018.06.012_bib0009) 2009; 57 Ehrgott (10.1016/j.ejor.2018.06.012_bib0007) 2004; 12 Klamroth (10.1016/j.ejor.2018.06.012_bib0011) 2015; 245 Lokman (10.1016/j.ejor.2018.06.012_bib0018) 2013; 57 Delort (10.1016/j.ejor.2018.06.012_bib0004) 2010 Kirlik (10.1016/j.ejor.2018.06.012_bib0010) 2014; 232 Sylva (10.1016/j.ejor.2018.06.012_bib0029) 2007; 180 Sylva (10.1016/j.ejor.2018.06.012_bib0028) 2004; 158 Przybylski (10.1016/j.ejor.2018.06.012_bib0024) 2008; 185 Laumanns (10.1016/j.ejor.2018.06.012_sbref0015) 2005 Özpeynirci (10.1016/j.ejor.2018.06.012_bib0023) 2010; 56 Przybylski (10.1016/j.ejor.2018.06.012_bib0025) 2010; 22 Lokman (10.1016/j.ejor.2018.06.012_bib0019) 2014; 46 Masin (10.1016/j.ejor.2018.06.012_bib0020) 2008; 56 Boland (10.1016/j.ejor.2018.06.012_bib0002) 2017; 260 Boland (10.1016/j.ejor.2018.06.012_bib0001) 2016; 8 Köksalan (10.1016/j.ejor.2018.06.012_bib0013) 2009; 56 Korhonen (10.1016/j.ejor.2018.06.012_bib0014) 1986; 24 Zitzler (10.1016/j.ejor.2018.06.012_bib0030) 2003; 7 |
| References_xml | – volume: 22 start-page: 371 year: 2010 end-page: 386 ident: bib0025 article-title: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme publication-title: INFORMS Journal on Computing – volume: 57 start-page: 187 year: 2009 end-page: 199 ident: bib0009 article-title: Generating a representative subset of the nondominated frontier in multiple criteria decision making publication-title: Operations Research – volume: 22 start-page: 425 year: 2000 end-page: 460 ident: bib0006 article-title: A survey and annotated bibliography of multiobjective combinatorial optimization publication-title: OR-Spektrum, – year: 2005 ident: bib0015 article-title: An adaptive scheme to generate the Pareto front based on the epsilon-constraint method publication-title: Practical approaches to multi-objective optimization. No 04461 – volume: 185 start-page: 509 year: 2008 end-page: 533 ident: bib0024 article-title: Two phase algorithms for the bi-objective assignment problem publication-title: European Journal of Operational Research – start-page: 253 year: 2010 end-page: 265 ident: bib0004 article-title: Using bound sets in multiobjective optimization: Application to the biobjective binary knapsack problem publication-title: Proceedings of the 2010 international symposium on experimental algorithms – volume: 24 start-page: 277 year: 1986 end-page: 287 ident: bib0014 article-title: A visual interactive method for solving the multiple criteria problem publication-title: European Journal of Operational Research – volume: 56 start-page: 191 year: 2009 end-page: 198 ident: bib0013 article-title: Approximating the nondominated frontiers of multi-objective combinatorial optimization problems publication-title: Naval Research Logistics – volume: 46 start-page: 777 year: 1999 end-page: 789 ident: bib0012 article-title: A heuristic approach to bicriteria scheduling publication-title: Naval Research Logistics – volume: 160 start-page: 470 year: 2014 end-page: 482 ident: bib0022 article-title: Multi-objective integer programming: An improved recursive algorithm publication-title: Journal of Optimization Theory and Applications – volume: 232 start-page: 479 year: 2014 end-page: 488 ident: bib0010 article-title: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems publication-title: European Journal of Operational Research – volume: 180 start-page: 1011 year: 2007 end-page: 1027 ident: bib0029 article-title: A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs publication-title: European Journal of Operational Research – volume: 61 start-page: 643 year: 2015 end-page: 676 ident: bib0003 article-title: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems publication-title: Journal of Global Optimization – volume: 34 start-page: 2450 year: 2007 end-page: 2462 ident: bib0017 article-title: Parallel partitioning method (PPM): A new exact method to solve bi-objective problems publication-title: Computers and Operations Research – volume: 56 start-page: 2302 year: 2010 end-page: 2315 ident: bib0023 article-title: An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs publication-title: Management Science – volume: 87 start-page: 543 year: 2000 ident: bib0026 article-title: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming publication-title: Mathematical Programming – volume: 51 start-page: 427 year: 2003 end-page: 436 ident: bib0027 article-title: a procedure to find discrete representations of the efficient set with specified coverage errors publication-title: Operations Research – volume: 56 start-page: 411 year: 2008 end-page: 424 ident: bib0020 article-title: Diversity maximization approach for multiobjective optimization publication-title: Operations Research – volume: 260 start-page: 873 year: 2017 end-page: 885 ident: bib0002 article-title: The quadrant shrinking method: A simple and efficient algorithm for solving tri-objective integer programs publication-title: European Journal of Operational Research – volume: 199 start-page: 25 year: 2009 end-page: 35 ident: bib0021 article-title: Multi-objective integer programming: A general approach for generating all non-dominated solutions publication-title: European Journal of Operational Research – volume: 7 start-page: 117 year: 2003 end-page: 132 ident: bib0030 article-title: Performance assessment of multiobjective optimizers: An analysis and review publication-title: IEEE Transactions on Evolutionary Computation – volume: 46 start-page: 1181 year: 2014 end-page: 1195 ident: bib0019 article-title: Finding highly preferred points for multi-objective integer programs publication-title: IIE Transactions – volume: 169 start-page: 932 year: 2006 end-page: 942 ident: bib0016 article-title: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method publication-title: European Journal of Operational Research – volume: 200 start-page: 45 year: 2010 end-page: 53 ident: bib0005 article-title: K-PPM: A new exact method to solve multi-objective combinatorial optimization problems publication-title: European Journal of Operational Research – volume: 114 start-page: 221 year: 2008 end-page: 259 ident: bib0008 article-title: Hybrid metaheuristics for multi-objective combinatorial optimization publication-title: Studies in Computational Intelligence (SCI) – volume: 57 start-page: 347 year: 2013 end-page: 365 ident: bib0018 article-title: Finding all nondominated points of multi-objective integer programs publication-title: Journal of Global Optimization – volume: 8 start-page: 217 year: 2016 end-page: 251 ident: bib0001 article-title: The L-shape search method for triobjective integer programming publication-title: Mathematical Programming Computation – volume: 245 start-page: 767 year: 2015 end-page: 778 ident: bib0011 article-title: On the representation of the search region in multi-objective optimization publication-title: European Journal of Operational Research – volume: 158 start-page: 46 year: 2004 end-page: 55 ident: bib0028 article-title: A method for finding the set of non-dominated vectors for multiple objective integer linear programs publication-title: European Journal of Operational Research – volume: 12 start-page: 1 year: 2004 end-page: 63 ident: bib0007 article-title: Approximative solution methods for multiobjective combinatorial optimization publication-title: Top – volume: 158 start-page: 46 issue: 1 year: 2004 ident: 10.1016/j.ejor.2018.06.012_bib0028 article-title: A method for finding the set of non-dominated vectors for multiple objective integer linear programs publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00255-8 – volume: 160 start-page: 470 issue: 2 year: 2014 ident: 10.1016/j.ejor.2018.06.012_bib0022 article-title: Multi-objective integer programming: An improved recursive algorithm publication-title: Journal of Optimization Theory and Applications doi: 10.1007/s10957-013-0364-y – volume: 232 start-page: 479 issue: 3 year: 2014 ident: 10.1016/j.ejor.2018.06.012_bib0010 article-title: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.08.001 – volume: 61 start-page: 643 issue: 4 year: 2015 ident: 10.1016/j.ejor.2018.06.012_bib0003 article-title: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems publication-title: Journal of Global Optimization doi: 10.1007/s10898-014-0205-z – volume: 57 start-page: 187 issue: 1 year: 2009 ident: 10.1016/j.ejor.2018.06.012_bib0009 article-title: Generating a representative subset of the nondominated frontier in multiple criteria decision making publication-title: Operations Research doi: 10.1287/opre.1080.0581 – volume: 114 start-page: 221 year: 2008 ident: 10.1016/j.ejor.2018.06.012_bib0008 article-title: Hybrid metaheuristics for multi-objective combinatorial optimization publication-title: Studies in Computational Intelligence (SCI) – volume: 180 start-page: 1011 issue: 3 year: 2007 ident: 10.1016/j.ejor.2018.06.012_bib0029 article-title: A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.02.049 – volume: 34 start-page: 2450 issue: 8 year: 2007 ident: 10.1016/j.ejor.2018.06.012_bib0017 article-title: Parallel partitioning method (PPM): A new exact method to solve bi-objective problems publication-title: Computers and Operations Research doi: 10.1016/j.cor.2005.09.014 – volume: 56 start-page: 411 issue: 2 year: 2008 ident: 10.1016/j.ejor.2018.06.012_bib0020 article-title: Diversity maximization approach for multiobjective optimization publication-title: Operations Research doi: 10.1287/opre.1070.0413 – volume: 24 start-page: 277 year: 1986 ident: 10.1016/j.ejor.2018.06.012_bib0014 article-title: A visual interactive method for solving the multiple criteria problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(86)90050-0 – volume: 57 start-page: 347 issue: 2 year: 2013 ident: 10.1016/j.ejor.2018.06.012_bib0018 article-title: Finding all nondominated points of multi-objective integer programs publication-title: Journal of Global Optimization doi: 10.1007/s10898-012-9955-7 – volume: 12 start-page: 1 issue: 1 year: 2004 ident: 10.1016/j.ejor.2018.06.012_bib0007 article-title: Approximative solution methods for multiobjective combinatorial optimization publication-title: Top doi: 10.1007/BF02578918 – volume: 245 start-page: 767 issue: 3 year: 2015 ident: 10.1016/j.ejor.2018.06.012_bib0011 article-title: On the representation of the search region in multi-objective optimization publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2015.03.031 – volume: 169 start-page: 932 issue: 3 year: 2006 ident: 10.1016/j.ejor.2018.06.012_bib0016 article-title: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.08.029 – volume: 22 start-page: 425 issue: 12 year: 2000 ident: 10.1016/j.ejor.2018.06.012_bib0006 article-title: A survey and annotated bibliography of multiobjective combinatorial optimization publication-title: OR-Spektrum, doi: 10.1007/s002910000046 – volume: 56 start-page: 191 issue: 2 year: 2009 ident: 10.1016/j.ejor.2018.06.012_bib0013 article-title: Approximating the nondominated frontiers of multi-objective combinatorial optimization problems publication-title: Naval Research Logistics doi: 10.1002/nav.20336 – year: 2005 ident: 10.1016/j.ejor.2018.06.012_sbref0015 article-title: An adaptive scheme to generate the Pareto front based on the epsilon-constraint method – volume: 199 start-page: 25 issue: 1 year: 2009 ident: 10.1016/j.ejor.2018.06.012_bib0021 article-title: Multi-objective integer programming: A general approach for generating all non-dominated solutions publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.10.023 – volume: 22 start-page: 371 issue: 3 year: 2010 ident: 10.1016/j.ejor.2018.06.012_bib0025 article-title: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.1090.0342 – volume: 185 start-page: 509 issue: 2 year: 2008 ident: 10.1016/j.ejor.2018.06.012_bib0024 article-title: Two phase algorithms for the bi-objective assignment problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.12.054 – volume: 56 start-page: 2302 issue: 12 year: 2010 ident: 10.1016/j.ejor.2018.06.012_bib0023 article-title: An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs publication-title: Management Science doi: 10.1287/mnsc.1100.1248 – volume: 8 start-page: 217 issue: 2 year: 2016 ident: 10.1016/j.ejor.2018.06.012_bib0001 article-title: The L-shape search method for triobjective integer programming publication-title: Mathematical Programming Computation doi: 10.1007/s12532-015-0093-3 – volume: 200 start-page: 45 issue: 1 year: 2010 ident: 10.1016/j.ejor.2018.06.012_bib0005 article-title: K-PPM: A new exact method to solve multi-objective combinatorial optimization problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.12.034 – volume: 46 start-page: 1181 issue: 11 year: 2014 ident: 10.1016/j.ejor.2018.06.012_bib0019 article-title: Finding highly preferred points for multi-objective integer programs publication-title: IIE Transactions doi: 10.1080/0740817X.2014.882532 – volume: 260 start-page: 873 issue: 3 year: 2017 ident: 10.1016/j.ejor.2018.06.012_bib0002 article-title: The quadrant shrinking method: A simple and efficient algorithm for solving tri-objective integer programs publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.03.035 – start-page: 253 year: 2010 ident: 10.1016/j.ejor.2018.06.012_bib0004 article-title: Using bound sets in multiobjective optimization: Application to the biobjective binary knapsack problem – volume: 46 start-page: 777 issue: 7 year: 1999 ident: 10.1016/j.ejor.2018.06.012_bib0012 article-title: A heuristic approach to bicriteria scheduling publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(199910)46:7<777::AID-NAV2>3.0.CO;2-5 – volume: 87 start-page: 543 issue: 3 year: 2000 ident: 10.1016/j.ejor.2018.06.012_bib0026 article-title: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming publication-title: Mathematical Programming doi: 10.1007/s101070050128 – volume: 7 start-page: 117 issue: 2 year: 2003 ident: 10.1016/j.ejor.2018.06.012_bib0030 article-title: Performance assessment of multiobjective optimizers: An analysis and review publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2003.810758 – volume: 51 start-page: 427 issue: 3 year: 2003 ident: 10.1016/j.ejor.2018.06.012_bib0027 article-title: a procedure to find discrete representations of the efficient set with specified coverage errors publication-title: Operations Research doi: 10.1287/opre.51.3.427.14951 |
| SSID | ssj0001515 |
| Score | 2.4224575 |
| Snippet | •Representative sets are found for multi-objective mixed integer programs.•A desired level of quality is guaranteed in representing the nondominated... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 61 |
| SubjectTerms | Mixed integer programming Multiple objective programming Nondominated point Representative subset |
| Title | Finding a representative nondominated set for multi-objective mixed integer programs |
| URI | https://dx.doi.org/10.1016/j.ejor.2018.06.012 |
| Volume | 272 |
| WOSCitedRecordID | wos000447084800006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LbxMxELZCihA9FAiglhbkA7fI1a4368exrVrKQxUSAeW28vqhJi2bKi-F38Efxl7bS9JABUhcVpEVbxzPl_GX2ZlvAHhNDMNUkATlTEnUy7FGjCuODFalVMoS5FpL78sHenHBBgP-sdX6HmthFte0qthyyW_-q6ntmDW2K539C3M3N7UD9rU1ur1as9vrHxn-bOgLVUS3FqwMxUUL3a1c5w6X-eJI5lTP6gzDOqEQjcuRd3zdr8OlVl5EQk9i9tb0t_H7wGXtwCRGFYN8UBNmPtHfLn2U9Y17Kn9Mri5_IvJ9GJq6DMs6ODu3N2qyhMZXIUB7LKr5aoDC1UStBSg2K2d8tRalCGNft3movfNlFCPCfH-B6J0xxRsw9L7Wi7iHU9v3gtk4D3xoYnSoR2Mn_pp6sdaQuL2us_3JLcmtyDo5J3pD7oEtTHPO2mDr6O3p4F1zwDsOWD-cCl8h1GL5tMHbn_RrvrPCYfqPwU748wGPPGiegJauOuBBrH3ogEexxwcMLr8DtlcEK5-CfgAXFHAdXHAVXNCCC1pwwVvggjW4YAAXjOB6Bj6fnfZPzlHoy4FkL-EzZLgxjEvCmNFpQsoyM1gay3pSYYhMjM5NJg0XUuGESMNkmTIuCDNUZkJbyvoctO2q9C6AGWe50qUsMWc9oUjZM0xzI3HOqCSl3ANp3L1CBtF61zvluojZiaPC7XjhdrxwKZop3gPdZs6Nl2y58915NEoRSKcnk4XF0B3zXvzjvH3wMP5IsvQAtGeTuX4J7svFbDidvApQ-wGpZap9 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Finding+a+representative+nondominated+set+for+multi-objective+mixed+integer+programs&rft.jtitle=European+journal+of+operational+research&rft.au=Ceyhan%2C+G%C3%B6khan&rft.au=K%C3%B6ksalan%2C+Murat&rft.au=Lokman%2C+Banu&rft.date=2019-01-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=272&rft.issue=1&rft.spage=61&rft.epage=77&rft_id=info:doi/10.1016%2Fj.ejor.2018.06.012&rft.externalDocID=S0377221718305356 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |