Quotation Parragh, Sophie N., Tricoire, Fabien. 2019. Branch-and-bound for biobjective integer programming. INFORMS Journal on Computing (JOC). 31 805-822.




In bi-objective integer optimization the optimal result corresponds to a set of non-dominated solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a problem-independent branching rule exploiting available integer solutions and takes advantage of integer objective coefficients. The developed algorithm is applied to bi-objective facility location problems, to the bi-objective set covering problem, as well as to the bi-objective team orienteering problem with time windows. In the latter case, lower bound sets are computed by means of column generation. Comparison to state-of-the-art exact algorithms shows the effectiveness of the proposed branch-and-bound algorithm.


Press 'enter' for creating the tag

Publication's profile

Status of publication Published
Affiliation External
Type of publication Journal article
Journal INFORMS Journal on Computing (JOC)
Citation Index SCI
WU Journalrating 2009 A
WU-Journal-Rating new FIN-A, INF-A, STRAT-A, WH-A
Language English
Title Branch-and-bound for biobjective integer programming
Volume 31
Year 2019
Page from 805
Page to 822
DOI https://doi.org/10.1287/ijoc.2018.0856
Open Access N


Tricoire, Fabien (Details)
Parragh, Sophie N. (JKU Linz, Austria)
Google Scholar: Search