Correction to: An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems

被引:0
|
作者
Angelo Aliano Filho
Antonio Carlos Moretti
Margarida Vaz Pato
Washington Alves de Oliveira
机构
[1] Federal Technological University of Paraná,Academic Department of Mathematics
[2] University of Campinas,Institute of Mathematics, Statistics and Scientific Computation
[3] Universidade de Lisboa,ISEG and CMAFcIO
[4] University of Campinas,School of Applied Sciences
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
In this article a part of the context sections has errors due to an incomplete revision for which the authors much apologize.
引用
收藏
页码:1255 / 1256
页数:1
相关论文
共 50 条
  • [1] An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
    Angelo Aliano Filho
    Antonio Carlos Moretti
    Margarida Vaz Pato
    Washington Alves de Oliveira
    [J]. Annals of Operations Research, 2021, 296 : 35 - 69
  • [2] An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
    Aliano Filho, Angelo
    Moretti, Antonio Carlos
    Pato, Margarida Vaz
    de Oliveira, Washington Alves
    [J]. ANNALS OF OPERATIONS RESEARCH, 2021, 296 (1-2) : 35 - 69
  • [3] An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (vol 296, 35, 2021)
    Filho, Angelo Aliano
    Moretti, Antonio Carlos
    Pato, Margarida Vaz
    de Oliveira, Washington Alves
    [J]. ANNALS OF OPERATIONS RESEARCH, 2024, 332 (1-3) : 1255 - 1256
  • [4] An exact algebraic ε-constraint method for bi-objective linear integer programming based on test sets
    Isabel Hartillo-Hermoso, Maria
    Jimenez-Tafur, Haydee
    Maria Ucha-Enriquez, Jose
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (02) : 453 - 463
  • [5] Mixed-Integer Benchmark Problems for Single- and Bi-Objective Optimization
    Tusar, Tea
    Brockhoff, Dimo
    Hansen, Nikolaus
    [J]. PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 718 - 726
  • [6] An Algorithm for Bi-Objective Integer Linear Programming Problem
    Prerna
    Sharma, Vikas
    [J]. FILOMAT, 2022, 36 (16) : 5641 - 5651
  • [7] On finding representative non-dominated points for bi-objective integer network flow problems
    Eusebio, A.
    Figueira, J. R.
    Ehrgott, M.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 48 : 1 - 10
  • [8] An exact ε-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits
    Berube, Jean-Francois
    Gendreau, Michel
    Potvin, Jean-Yves
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 194 (01) : 39 - 50
  • [9] Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
    Lemesre, J.
    Dhaenens, C.
    Talbi, E. G.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (08) : 2450 - 2462
  • [10] A new trisection method for solving Lipschitz bi-objective optimization problems
    Naffeti, Bechir
    Ammar, Hamadi
    [J]. MATHEMATICS AND COMPUTERS IN SIMULATION, 2021, 190 : 1186 - 1205