Logo do repositório
 
Publicação

On finding representative non-dominated points for bi-objective integer network flow problems

2014-08Artigo científico Acesso restrito
Ver registo simples
datacite.subject.fosCiências Naturais::Ciências da Computação e da Informação
datacite.subject.fosCiências Naturais::Matemáticas
datacite.subject.fosCiências Sociais::Economia e Gestão
datacite.subject.sdg07:Energias Renováveis e Acessíveis
datacite.subject.sdg11:Cidades e Comunidades Sustentáveis
dc.contributor.authorEusébio, A.
dc.contributor.authorFigueira, J. R.
dc.contributor.authorEhrgott, M.
dc.date.accessioned2026-06-12T14:01:57Z
dc.date.available2026-06-12T14:01:57Z
dc.date.issued2014-08
dc.description.abstractThis paper proposes a new algorithm to find a representation of the set of all non-dominated points of the bi-objective integer network flow problem. The algorithm solves a sequence of ε-constraint problems with a branch-and-bound algorithm to find a subset of non-dominated points that represents the set of all non-dominated points well in the sense of coverage or uniformity. At each iteration of the algorithm, one non-dominated point, determined by solving one ε-constraint problem, is added to the representation until it is guaranteed that the representation has the desired quality. Computational experiments on different problem types show the efficacy of the algorithm.eng
dc.identifier.citationA. Eusébio, J.R. Figueira, M. Ehrgott, On finding representative non-dominated points for bi-objective integer network flow problems, Computers & Operations Research, Volume 48, 2014, Pages 1-10, ISSN 0305-0548, https://doi.org/10.1016/j.cor.2014.02.009.
dc.identifier.doi10.1016/j.cor.2014.02.009
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/10400.8/16410
dc.language.isoeng
dc.peerreviewedyes
dc.publisherElsevier
dc.relation.hasversionhttps://www.sciencedirect.com/science/article/pii/S0305054814000446?via%3Dihub
dc.relation.ispartofComputers & Operations Research
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.subjectMulti-objective optimisation
dc.subjectNetwork optimisation
dc.subjectInteger programming
dc.subjectε-Constraint method
dc.subjectBi-objective network flow problem
dc.subjectRepresentation
dc.titleOn finding representative non-dominated points for bi-objective integer network flow problemseng
dc.typejournal article
dspace.entity.typePublication
oaire.citation.endPage10
oaire.citation.startPage1
oaire.citation.titleComputers and Operations Research
oaire.citation.volume48
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
person.familyNameEusébio
person.givenNameAugusto
person.identifier.orcid0000-0002-6800-2016
person.identifier.scopus-author-id24779439000
relation.isAuthorOfPublicatione1266cbb-dcd0-47d5-92e8-1c345ea5e675
relation.isAuthorOfPublication.latestForDiscoverye1266cbb-dcd0-47d5-92e8-1c345ea5e675

Ficheiros

Principais
A mostrar 1 - 1 de 1
Miniatura indisponível
Nome:
On finding representative non-dominated points for bi-objective integer network flow problems.pdf
Tamanho:
538.71 KB
Formato:
Adobe Portable Document Format
Descrição:
This paper proposes a new algorithm to find a representation of the set of all non-dominated points of the bi-objective integer network flow problem. The algorithm solves a sequence of ε-constraint problems with a branch-and-bound algorithm to find a subset of non-dominated points that represents the set of all non-dominated points well in the sense of coverage or uniformity. At each iteration of the algorithm, one non-dominated point, determined by solving one ε-constraint problem, is added to the representation until it is guaranteed that the representation has the desired quality. Computational experiments on different problem types show the efficacy of the algorithm.
Ver/Abrir
Licença
A mostrar 1 - 1 de 1
Miniatura indisponível
Nome:
license.txt
Tamanho:
1.32 KB
Formato:
Item-specific license agreed upon to submission
Descrição:
Ver/Abrir

Coleções

ESTG - Artigos em revistas internacionais