An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets
•We present a new exact algorithm for bi-objective linear integer problems.•Based on the epsilon-constraint method and algebraic test sets for integer problems.•The Pareto frontier is obtained solving exactly one problem for each point.•Integer problems are solved via reduction with test set, not us...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research Jg. 282; H. 2; S. 453 - 463 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
16.04.2020
|
| Schlagworte: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •We present a new exact algorithm for bi-objective linear integer problems.•Based on the epsilon-constraint method and algebraic test sets for integer problems.•The Pareto frontier is obtained solving exactly one problem for each point.•Integer problems are solved via reduction with test set, not using an optimizer.•We obtain efficient points directly, avoiding weakly efficient ones.
A new exact algorithm for bi-objective linear integer problems is presented, based on the classic ϵ-constraint method and algebraic test sets for single-objective linear integer problems. Our method provides the complete Pareto frontier N of non-dominated points and, for this purpose, it considers exactly |N| single-objective problems by using reduction with test sets instead of solving with an optimizer. Although we use Gröbner bases for the computation of test sets, which may provoke a bottleneck in principle, the computational results are shown to be promising, especially for unbounded knapsack problems, for which any usual branch-and-cut strategy could be much more expensive. Nevertheless, this algorithm can be considered as a potentially faster alternative to IP-based methods when test sets are available. |
|---|---|
| AbstractList | •We present a new exact algorithm for bi-objective linear integer problems.•Based on the epsilon-constraint method and algebraic test sets for integer problems.•The Pareto frontier is obtained solving exactly one problem for each point.•Integer problems are solved via reduction with test set, not using an optimizer.•We obtain efficient points directly, avoiding weakly efficient ones.
A new exact algorithm for bi-objective linear integer problems is presented, based on the classic ϵ-constraint method and algebraic test sets for single-objective linear integer problems. Our method provides the complete Pareto frontier N of non-dominated points and, for this purpose, it considers exactly |N| single-objective problems by using reduction with test sets instead of solving with an optimizer. Although we use Gröbner bases for the computation of test sets, which may provoke a bottleneck in principle, the computational results are shown to be promising, especially for unbounded knapsack problems, for which any usual branch-and-cut strategy could be much more expensive. Nevertheless, this algorithm can be considered as a potentially faster alternative to IP-based methods when test sets are available. |
| Author | Ucha-Enríquez, José María Jiménez-Tafur, Haydee Hartillo-Hermoso, María Isabel |
| Author_xml | – sequence: 1 givenname: María Isabel surname: Hartillo-Hermoso fullname: Hartillo-Hermoso, María Isabel organization: Departamento de Matemática Aplicada I, E. T. S. de Ingeniería Informática, Universidad de Sevilla, Av. Reina Mercedes s/n, Sevilla 41012, Spain – sequence: 2 givenname: Haydee surname: Jiménez-Tafur fullname: Jiménez-Tafur, Haydee organization: Instituto de Matemáticas, Universidad de Sevilla, Avda. Reina Mercedes, s/n, Sevilla 41012, Spain – sequence: 3 givenname: José María orcidid: 0000-0002-2014-279X surname: Ucha-Enríquez fullname: Ucha-Enríquez, José María email: ucha@us.es organization: Departamento de Matemática Aplicada I, E. T. S. de Ingeniería Informática, Universidad de Sevilla, Av. Reina Mercedes s/n, Sevilla 41012, Spain |
| BookMark | eNp9kE1qwzAQRkVJoUnaC3SlC9iVrFiWoZsQ-geBbtq1kKWxK2NLQRKhPVjP0SvVJl11EfhgGJg3zLwVWjjvAKFbSnJKKL_rc-h9yAtC65xMYcUFWlJRFRkXnCzQkrCqyoqCVldoFWNPCKElLZeo3ToMn0onrIYOmqCsxj_fmfYupqlxCY-QPrzBrQ-4sZlvetDJHgEP1oEKeBqBDgI-BN8FNY7WdbhREQz2DieICUdI8RpdtmqIcPNX1-j98eFt95ztX59edtt9pqf7UtbWhG_IRgsB0HBGAUSpmQEFDOqabjhTxlSmoWVLKl4yLbQpWMlBMA5VK9gaFae9OvgYA7TyEOyowpekRM6mZC9nU3I2JckUVkyQ-Adpm1Sy3s0KhvPo_QmF6amjhSCjtuA0GBsmT9J4ew7_BZDziYI |
| CitedBy_id | crossref_primary_10_1007_s41660_020_00125_8 crossref_primary_10_1007_s10668_024_05549_7 crossref_primary_10_1016_j_eswa_2022_118577 crossref_primary_10_1016_j_jweia_2022_104992 crossref_primary_10_1016_j_cor_2025_107204 crossref_primary_10_1016_j_knosys_2022_109462 crossref_primary_10_1016_j_scs_2023_104561 crossref_primary_10_1016_j_eti_2025_104219 crossref_primary_10_1016_j_ocecoaman_2023_106816 crossref_primary_10_1155_2021_6653586 crossref_primary_10_1002_mcda_1780 |
| Cites_doi | 10.1016/j.ejor.2013.11.032 10.1016/j.ejor.2013.09.001 10.1016/j.cor.2007.09.009 10.1016/j.artint.2013.08.001 10.1016/j.ejor.2013.08.001 10.1109/99.714603 10.1016/j.cor.2005.10.003 10.1287/mnsc.46.7.999.12033 10.1007/s002000050062 10.1016/0001-8708(82)90048-2 10.1016/j.amc.2009.03.037 10.1287/moor.20.4.864 10.1007/s10957-008-9394-2 10.1016/j.ejor.2004.08.029 10.1137/070698051 10.1007/s10479-006-0058-z 10.1016/j.ejor.2013.05.045 10.1016/j.jsc.2010.10.003 10.1016/j.amc.2013.03.002 |
| ContentType | Journal Article |
| Copyright | 2019 Elsevier B.V. |
| Copyright_xml | – notice: 2019 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2019.09.032 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 463 |
| ExternalDocumentID | 10_1016_j_ejor_2019_09_032 S0377221719307891 |
| 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 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 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 EJD FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c377t-f906404c88eeb631ee85c3deae3e991463add7db15f07653c8cd2356e836e7f83 |
| ISICitedReferencesCount | 12 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000509789300005&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 | Sat Nov 29 07:21:12 EST 2025 Tue Nov 18 22:43:53 EST 2025 Fri Feb 23 02:49:42 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Non-dominated set Pareto set ϵ-constraint method Unbounded Knapsack Problem Algebraic test sets Multiple objective programming |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c377t-f906404c88eeb631ee85c3deae3e991463add7db15f07653c8cd2356e836e7f83 |
| ORCID | 0000-0002-2014-279X |
| OpenAccessLink | https://idus.us.es/handle//11441/104592 |
| PageCount | 11 |
| ParticipantIDs | crossref_primary_10_1016_j_ejor_2019_09_032 crossref_citationtrail_10_1016_j_ejor_2019_09_032 elsevier_sciencedirect_doi_10_1016_j_ejor_2019_09_032 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-04-16 |
| PublicationDateYYYYMMDD | 2020-04-16 |
| PublicationDate_xml | – month: 04 year: 2020 text: 2020-04-16 day: 16 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2020 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Bringmann, Friedrich, Igel, Voß (bib0007) 2013; 204 Kirlik, Sayın (bib0016) 2014; 232 Bazgan, Hugot, Vanderpooten (bib0001) 2009; 36 Mavrotas, Florios (bib0019) 2013; 219 Zhang, Reimann (bib0030) 2014; 234 Bertsimas, Weismantel (bib0003) 2005 De Loera, Hemmecke, Köppe (bib0010) 2013 Gropp, Moré (bib0015) 1997 Rong, Figueira (bib0023) 2013; 231 Ehrgott, Ruzika (bib0014) 2008; 138 Rong, Figueira (bib0024) 2014; 236 Ehrgott (bib0012) 2005 Thomas, Weismantel (bib0029) 1997; 8 Bertsimas, Perakis, Tayur (bib0002) 2000; 46 Natraj, Tayur, Thomas (bib0021) 1995; 69 Ehrgott, Gandibleux (bib0013) 2007; 34 Sturmfels (bib0026) 1996; 8 Boland, Charkhgard, Savelsbergh (bib0006) 2014; 8494 Mayr, Meyer (bib0020) 1982; 46 Thomas (bib0028) 1995; 20 Mavrotas (bib0018) 2009; 213 . Cox, Little, O’Shea (bib0008) 2005; 185 Laumanns, Thiele, Zitzler (bib0017) 2006; 169 4ti2 team (2015). 4ti2—a software package for algebraic, geometric and combinatorial problems on linear spaces. Available at Dolan (bib0011) 2001 Blanco, Puerto (bib0004) 2009; 23 Schrijver (bib0025) 1986 Blanco, Puerto (bib0005) 2011; 46 Ralphs, Saltzman, Wiecek (bib0022) 2006; 147 Czyzyk, Mesnier, Moré (bib0009) 1998; 5 Bertsimas (10.1016/j.ejor.2019.09.032_bib0003) 2005 Ehrgott (10.1016/j.ejor.2019.09.032_bib0013) 2007; 34 Mavrotas (10.1016/j.ejor.2019.09.032_bib0019) 2013; 219 Blanco (10.1016/j.ejor.2019.09.032_bib0005) 2011; 46 Thomas (10.1016/j.ejor.2019.09.032_bib0029) 1997; 8 Natraj (10.1016/j.ejor.2019.09.032_bib0021) 1995; 69 De Loera (10.1016/j.ejor.2019.09.032_bib0010) 2013 Dolan (10.1016/j.ejor.2019.09.032_bib0011) 2001 Rong (10.1016/j.ejor.2019.09.032_bib0024) 2014; 236 Ralphs (10.1016/j.ejor.2019.09.032_bib0022) 2006; 147 Thomas (10.1016/j.ejor.2019.09.032_bib0028) 1995; 20 Blanco (10.1016/j.ejor.2019.09.032_bib0004) 2009; 23 Ehrgott (10.1016/j.ejor.2019.09.032_bib0012) 2005 Boland (10.1016/j.ejor.2019.09.032_bib0006) 2014; 8494 Cox (10.1016/j.ejor.2019.09.032_bib0008) 2005; 185 Mayr (10.1016/j.ejor.2019.09.032_bib0020) 1982; 46 Gropp (10.1016/j.ejor.2019.09.032_bib0015) 1997 Kirlik (10.1016/j.ejor.2019.09.032_bib0016) 2014; 232 Ehrgott (10.1016/j.ejor.2019.09.032_bib0014) 2008; 138 Schrijver (10.1016/j.ejor.2019.09.032_sbref0024) 1986 Bringmann (10.1016/j.ejor.2019.09.032_bib0007) 2013; 204 Czyzyk (10.1016/j.ejor.2019.09.032_bib0009) 1998; 5 Bazgan (10.1016/j.ejor.2019.09.032_bib0001) 2009; 36 Laumanns (10.1016/j.ejor.2019.09.032_bib0017) 2006; 169 Mavrotas (10.1016/j.ejor.2019.09.032_bib0018) 2009; 213 10.1016/j.ejor.2019.09.032_bib0027 Zhang (10.1016/j.ejor.2019.09.032_bib0030) 2014; 234 Rong (10.1016/j.ejor.2019.09.032_bib0023) 2013; 231 Sturmfels (10.1016/j.ejor.2019.09.032_bib0026) 1996; 8 Bertsimas (10.1016/j.ejor.2019.09.032_bib0002) 2000; 46 |
| References_xml | – reference: 4ti2 team (2015). 4ti2—a software package for algebraic, geometric and combinatorial problems on linear spaces. Available at – start-page: 167 year: 1997 ident: bib0015 article-title: Optimization environments and the NEOS server publication-title: Approximation theory and optimization – volume: 23 start-page: 571 year: 2009 end-page: 595 ident: bib0004 article-title: Partial Gröbner bases for multiobjective integer linear optimization publication-title: SIAM Journal of Discrete Mathemetics – volume: 219 start-page: 9652 year: 2013 end-page: 9669 ident: bib0019 article-title: An improved version of the augmented ϵ-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems publication-title: Applied Mathematics and Computation – volume: 234 start-page: 15 year: 2014 end-page: 24 ident: bib0030 article-title: A simple augmented ϵ-constraint method for multi-objective mathematical integer programming problems publication-title: European Journal of Operational Research – volume: 138 start-page: 375 year: 2008 end-page: 396 ident: bib0014 article-title: Improved ϵ-constraint method for multiobjective programming publication-title: Journal of Optimization Theory Applications – volume: 185 year: 2005 ident: bib0008 article-title: Using algebraic geometry publication-title: Graduate texts in mathematics – volume: 8 year: 1996 ident: bib0026 article-title: Gröbner bases and convex polytopes publication-title: University Lecture Series – volume: 34 start-page: 2674 year: 2007 end-page: 2694 ident: bib0013 article-title: Bound sets for biobjective combinatorial optimization problems publication-title: Computers and Operations Research – volume: 5 start-page: 68 year: 1998 end-page: 75 ident: bib0009 article-title: The NEOS Server publication-title: IEEE Journal on Computational Science and Engineering – volume: 8494 start-page: 162 year: 2014 end-page: 173 ident: bib0006 article-title: The triangle splitting method for biobjective integer programming publication-title: Integer programming and combinatorial optimization – year: 2005 ident: bib0012 article-title: Multicriteria optimization – year: 2013 ident: bib0010 article-title: Algebraic and geometric ideas in the theory of discrete optimization – volume: 36 start-page: 260 year: 2009 end-page: 279 ident: bib0001 article-title: Solving efficiently the 0–1 multi-objective knapsack problem publication-title: Computers & Operations Research – year: 2005 ident: bib0003 article-title: Optimization over integers – volume: 46 start-page: 511 year: 2011 end-page: 533 ident: bib0005 article-title: Some algebraic methods for solving multiobjective polynomial integer programs publication-title: Journal of Symbolic Computations – volume: 147 start-page: 43 year: 2006 end-page: 70 ident: bib0022 article-title: An improved algorithm for solving biobjective integer programs publication-title: Annals of Operations Research – year: 1986 ident: bib0025 article-title: Theory of linear and integer programming publication-title: Wiley-Interscience Series in Discrete Mathematics – volume: 213 start-page: 455 year: 2009 end-page: 465 ident: bib0018 article-title: Effective implementation of the ϵ-constraint method in multi-objective mathematical programming problems publication-title: Applied Mathematics and Computation – reference: . – volume: 236 start-page: 85 year: 2014 end-page: 99 ident: bib0024 article-title: Dynamic programming algorithms for the bi-objective integer knapsack problem publication-title: European Journal of Operational Research – volume: 8 start-page: 241 year: 1997 end-page: 256 ident: bib0029 article-title: Truncated Gröbner bases for integer programming publication-title: Applicable Algebra in Engineering, Communication and Computing – volume: 204 start-page: 22 year: 2013 end-page: 29 ident: bib0007 article-title: Speeding up many-objective optimization by Monte Carlo approximations publication-title: Artificial Intelligence – volume: 46 start-page: 999 year: 2000 end-page: 1008 ident: bib0002 article-title: A new algebraic geometry algorithm for integer programming publication-title: Management Science – volume: 169 start-page: 932 year: 2006 end-page: 942 ident: bib0017 article-title: An efficient, adaptative parameter variation scheme for metaheuristics based on the epsilon-constraint method publication-title: European Journal of Operational Research – volume: 46 start-page: 305 year: 1982 end-page: 329 ident: bib0020 article-title: The complexity of the word problems for commutative semigroups and polynomial ideals publication-title: Advance in Mathematics – volume: 232 start-page: 479 year: 2014 end-page: 488 ident: bib0016 article-title: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems publication-title: European Journal of Operational Research – volume: 69 start-page: 369 year: 1995 end-page: 401 ident: bib0021 article-title: An algebraic geometry algorithm for scheduling in presence of setups and correlated demands publication-title: Mathematical Programming – year: 2001 ident: bib0011 article-title: The NEOS Server 4.0 administrative guide publication-title: Technical Memorandum ANL/MCS-TM-250 – volume: 231 start-page: 299 year: 2013 end-page: 313 ident: bib0023 article-title: A reduction dynamic programming algorithm for the bi-objective integer knapsack problem publication-title: European Journal of Operational Research – volume: 20 start-page: 864 year: 1995 end-page: 884 ident: bib0028 article-title: A geometric buchberger algorithm for integer programming publication-title: Mathematics of Operations Research – volume: 236 start-page: 85 year: 2014 ident: 10.1016/j.ejor.2019.09.032_bib0024 article-title: Dynamic programming algorithms for the bi-objective integer knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.11.032 – volume: 234 start-page: 15 year: 2014 ident: 10.1016/j.ejor.2019.09.032_bib0030 article-title: A simple augmented ϵ-constraint method for multi-objective mathematical integer programming problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.09.001 – volume: 36 start-page: 260 year: 2009 ident: 10.1016/j.ejor.2019.09.032_bib0001 article-title: Solving efficiently the 0–1 multi-objective knapsack problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2007.09.009 – volume: 204 start-page: 22 year: 2013 ident: 10.1016/j.ejor.2019.09.032_bib0007 article-title: Speeding up many-objective optimization by Monte Carlo approximations publication-title: Artificial Intelligence doi: 10.1016/j.artint.2013.08.001 – volume: 8 year: 1996 ident: 10.1016/j.ejor.2019.09.032_bib0026 article-title: Gröbner bases and convex polytopes – volume: 232 start-page: 479 year: 2014 ident: 10.1016/j.ejor.2019.09.032_bib0016 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: 5 start-page: 68 issue: 3 year: 1998 ident: 10.1016/j.ejor.2019.09.032_bib0009 article-title: The NEOS Server publication-title: IEEE Journal on Computational Science and Engineering doi: 10.1109/99.714603 – volume: 34 start-page: 2674 issue: 9 year: 2007 ident: 10.1016/j.ejor.2019.09.032_bib0013 article-title: Bound sets for biobjective combinatorial optimization problems publication-title: Computers and Operations Research doi: 10.1016/j.cor.2005.10.003 – volume: 46 start-page: 999 issue: 7 year: 2000 ident: 10.1016/j.ejor.2019.09.032_bib0002 article-title: A new algebraic geometry algorithm for integer programming publication-title: Management Science doi: 10.1287/mnsc.46.7.999.12033 – ident: 10.1016/j.ejor.2019.09.032_bib0027 – volume: 8 start-page: 241 year: 1997 ident: 10.1016/j.ejor.2019.09.032_bib0029 article-title: Truncated Gröbner bases for integer programming publication-title: Applicable Algebra in Engineering, Communication and Computing doi: 10.1007/s002000050062 – volume: 46 start-page: 305 issue: 3 year: 1982 ident: 10.1016/j.ejor.2019.09.032_bib0020 article-title: The complexity of the word problems for commutative semigroups and polynomial ideals publication-title: Advance in Mathematics doi: 10.1016/0001-8708(82)90048-2 – volume: 69 start-page: 369 issue: 3, Ser. A year: 1995 ident: 10.1016/j.ejor.2019.09.032_bib0021 article-title: An algebraic geometry algorithm for scheduling in presence of setups and correlated demands publication-title: Mathematical Programming – volume: 8494 start-page: 162 year: 2014 ident: 10.1016/j.ejor.2019.09.032_bib0006 article-title: The triangle splitting method for biobjective integer programming – year: 2005 ident: 10.1016/j.ejor.2019.09.032_bib0012 – volume: 213 start-page: 455 year: 2009 ident: 10.1016/j.ejor.2019.09.032_bib0018 article-title: Effective implementation of the ϵ-constraint method in multi-objective mathematical programming problems publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2009.03.037 – year: 2013 ident: 10.1016/j.ejor.2019.09.032_bib0010 – year: 2005 ident: 10.1016/j.ejor.2019.09.032_bib0003 – year: 2001 ident: 10.1016/j.ejor.2019.09.032_bib0011 article-title: The NEOS Server 4.0 administrative guide – volume: 20 start-page: 864 issue: 4 year: 1995 ident: 10.1016/j.ejor.2019.09.032_bib0028 article-title: A geometric buchberger algorithm for integer programming publication-title: Mathematics of Operations Research doi: 10.1287/moor.20.4.864 – year: 1986 ident: 10.1016/j.ejor.2019.09.032_sbref0024 article-title: Theory of linear and integer programming – volume: 138 start-page: 375 issue: 3 year: 2008 ident: 10.1016/j.ejor.2019.09.032_bib0014 article-title: Improved ϵ-constraint method for multiobjective programming publication-title: Journal of Optimization Theory Applications doi: 10.1007/s10957-008-9394-2 – start-page: 167 year: 1997 ident: 10.1016/j.ejor.2019.09.032_bib0015 article-title: Optimization environments and the NEOS server – volume: 169 start-page: 932 year: 2006 ident: 10.1016/j.ejor.2019.09.032_bib0017 article-title: An efficient, adaptative 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: 23 start-page: 571 issue: 2 year: 2009 ident: 10.1016/j.ejor.2019.09.032_bib0004 article-title: Partial Gröbner bases for multiobjective integer linear optimization publication-title: SIAM Journal of Discrete Mathemetics doi: 10.1137/070698051 – volume: 147 start-page: 43 issue: 1 year: 2006 ident: 10.1016/j.ejor.2019.09.032_bib0022 article-title: An improved algorithm for solving biobjective integer programs publication-title: Annals of Operations Research doi: 10.1007/s10479-006-0058-z – volume: 185 year: 2005 ident: 10.1016/j.ejor.2019.09.032_bib0008 article-title: Using algebraic geometry – volume: 231 start-page: 299 year: 2013 ident: 10.1016/j.ejor.2019.09.032_bib0023 article-title: A reduction dynamic programming algorithm for the bi-objective integer knapsack problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.05.045 – volume: 46 start-page: 511 issue: 5 year: 2011 ident: 10.1016/j.ejor.2019.09.032_bib0005 article-title: Some algebraic methods for solving multiobjective polynomial integer programs publication-title: Journal of Symbolic Computations doi: 10.1016/j.jsc.2010.10.003 – volume: 219 start-page: 9652 year: 2013 ident: 10.1016/j.ejor.2019.09.032_bib0019 article-title: An improved version of the augmented ϵ-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2013.03.002 |
| SSID | ssj0001515 |
| Score | 2.3896797 |
| Snippet | •We present a new exact algorithm for bi-objective linear integer problems.•Based on the epsilon-constraint method and algebraic test sets for integer... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 453 |
| SubjectTerms | Algebraic test sets Multiple objective programming Non-dominated set Pareto set Unbounded Knapsack Problem ϵ-constraint method |
| Title | An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets |
| URI | https://dx.doi.org/10.1016/j.ejor.2019.09.032 |
| Volume | 282 |
| WOSCitedRecordID | wos000509789300005&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/eLvHCXMwtV1ba9swFBahHWN72CXbWHdDD-tT0Egsy5Ifsy4lLaPsIYW8GUs-pgmpXZK0dP1f_R192Q_akSU7puvK-jAIJohYvpwv-o50zvlEyOcolpprFTMTKs1CmQUMp2ADpsI0zAApIXciSd_l0ZGaTuMfnc6vuhbmYiGLQl1exmf_1dTYhsa2pbMPMHfTKTbgdzQ6HtHsePwnww-tbL-tfLQ7eOBceGZ6u3v7u18FM9YXtFtCrP3G0S5Xc8ZKPXfjXs86nTYt1YpIwLLO3jq16wmW77IqtoBE0luBk4C6c1Xfe7jYsKzXGr2o0MlmxMM7XyxKNkZqKFelrxuq4vbf0t7BKtXQJH8czk5dQL-AKzZJ8_MKZuP0ZwYNLo_NScpGhe8B2e7KBzjcma3O2wsdgc06Za4Osy7wkpIFgSv1rAfvQAUtlAatoTh0IsSe1UM3jP5BGG7tYv4F5qVVhx3ETvU22NBjnRJwizWbXMY6TW6e2D4S20fSxw9Hx2A7kCJGutgeHoymh42HYJ3IKrrlH8gXc7m8w9t3crfD1HKCJi_IMz97oUOHupekA0WXPK6LJ7rkeb1JCPWc0SVPW4qXr0g-LGiFTtqgk95ct5BJHTIpIpO2kUkdMqlHJm0hk1bIpGVBLTKpReZrcrw_muyNmd_qgxl8CWuWxzaiHBqlAHTEBwBKGJ5BChxwBoPWQx6WmR6IvC8jwY0yWcBFBIpHIHPF35CtoizgLaECQAgwXGgdhMBj3c-1TlWUcxFrKfQOGdTvMzFeB98-4SL5uyV3SK8558ypwNz7a1GbKfF-rPNPE0TdPee9e9BV3pMnm3_JB7K1Xp7DR_LIXKxnq-UnD7nfi2TAeg |
| 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=An+exact+algebraic+%CF%B5-constraint+method+for+bi-objective+linear+integer+programming+based+on+test+sets&rft.jtitle=European+journal+of+operational+research&rft.au=Hartillo-Hermoso%2C+Mar%C3%ADa+Isabel&rft.au=Jim%C3%A9nez-Tafur%2C+Haydee&rft.au=Ucha-Enr%C3%ADquez%2C+Jos%C3%A9+Mar%C3%ADa&rft.date=2020-04-16&rft.issn=0377-2217&rft.volume=282&rft.issue=2&rft.spage=453&rft.epage=463&rft_id=info:doi/10.1016%2Fj.ejor.2019.09.032&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2019_09_032 |
| 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 |