Two-phases method and Branch and Bound procedures to solve the bi-objective knapsack problem

被引：0
|
作者：
机构：
来源：
J of Global Optim | / 2卷 / 139-155期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
    Khoudi, Asmaa
    Berrichi, Ali
    OPERATIONAL RESEARCH, 2020, 20 (03) : 1763 - 1789
  • [32] Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem
    Figueira, Jose Rui
    Paquete, Luis
    Simoes, Marco
    Vanderpooten, Daniel
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 56 (01) : 97 - 111
  • [33] A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem
    Aider, Meziane
    Gacem, Oussama
    Hifi, Mhand
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 191
  • [34] Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem
    José Rui Figueira
    Luís Paquete
    Marco Simões
    Daniel Vanderpooten
    Computational Optimization and Applications, 2013, 56 : 97 - 111
  • [35] Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
    Mavrotas, George
    Figueira, Jose Rui
    Florios, Kostas
    APPLIED MATHEMATICS AND COMPUTATION, 2009, 215 (07) : 2502 - 2514
  • [36] A tabu search algorithm to solve a green logistics bi-objective bi-level problem
    Camacho-Vallejo, Jose-Fernando
    Lopez-Vera, Lilian
    Smith, Alice E.
    Gonzalez-Velarde, Jose-Luis
    ANNALS OF OPERATIONS RESEARCH, 2022, 316 (02) : 927 - 953
  • [37] Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
    Delorme, Xavier
    Gandibleux, Xavier
    Degoutin, Fabien
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 204 (02) : 206 - 217
  • [38] A tabu search algorithm to solve a green logistics bi-objective bi-level problem
    José-Fernando Camacho-Vallejo
    Lilian López-Vera
    Alice E. Smith
    José-Luis González-Velarde
    Annals of Operations Research, 2022, 316 : 927 - 953
  • [39] Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
    Kolpakov, R. M.
    Posypkin, M. A.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2010, 20 (01): : 95 - 112
  • [40] Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets
    Gadegaard, Sune Lauth
    Nielsen, Lars Relund
    Ehrgott, Matthias
    INFORMS JOURNAL ON COMPUTING, 2019, 31 (04) : 790 - 804
12345