dc.creator | Hartillo Hermoso, Isabel | es |
dc.creator | Jiménez Tafur, Haydee | es |
dc.creator | Ucha Enríquez, José María | es |
dc.date.accessioned | 2021-02-04T10:37:40Z | |
dc.date.available | 2021-02-04T10:37:40Z | |
dc.date.issued | 2020 | |
dc.identifier.citation | Hartillo Hermoso, I., Jiménez Tafur, H. y Ucha Enríquez, J.M. (2020). An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets. European Journal of Operational Research, 282 (2), 453-463. | |
dc.identifier.issn | 0377-2217 | es |
dc.identifier.uri | https://hdl.handle.net/11441/104592 | |
dc.description.abstract | 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 pro- vides 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. Al- though we use Gröbner bases for the computation of test sets, which may provoke a bottleneck in princi- ple, 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 algorithmcan be considered as a potentially faster alternative to IP-based methods when test sets are available. | es |
dc.description.sponsorship | Ministerio de Economía y Competitividad MTM2016-74983-C2-1-R | es |
dc.description.sponsorship | Ministerio de Economía y Competitividad MTM2016-75024-P | es |
dc.description.sponsorship | Junta de Andalucía P12-FQM-2696 | es |
dc.format | application/pdf | es |
dc.format.extent | 11 | es |
dc.language.iso | eng | es |
dc.publisher | Elsevier | es |
dc.relation.ispartof | European Journal of Operational Research, 282 (2), 453-463. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Multiple objective programming | es |
dc.subject | Non-dominated set | es |
dc.subject | Pareto set | es |
dc.subject | ϵ-constraint method | es |
dc.subject | Unbounded Knapsack Problem | es |
dc.subject | Algebraic test sets | es |
dc.title | An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) | es |
dc.relation.projectID | MTM2016-74983-C2-1-R | es |
dc.relation.projectID | MTM2016-75024-P | es |
dc.relation.projectID | P12-FQM-2696 | es |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0377221719307891 | es |
dc.identifier.doi | 10.1016/j.ejor.2019.09.032 | es |
dc.journaltitle | European Journal of Operational Research | es |
dc.publication.volumen | 282 | es |
dc.publication.issue | 2 | es |
dc.publication.initialPage | 453 | es |
dc.publication.endPage | 463 | es |
dc.contributor.funder | Ministerio de Economía y Competitividad (MINECO). España | es |
dc.contributor.funder | Junta de Andalucía | es |