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 条
  • [41] Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
    Lemesre, J.
    Dhaenens, C.
    Talbi, E. G.
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (08) : 2450 - 2462
  • [42] A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
    Ammar, Hamadi
    Naffeti, Bechir
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2023, 204 : 181 - 201
  • [43] Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem
    Legrand, Clement
    Cattaruzza, Diego
    Jourdan, Laetitia
    Kessaci, Marie-Eleonore
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2025, 32 (01) : 117 - 143
  • [44] Electromagnetism-like method for bi-objective optimization problem
    Han, Li-Xia
    Wang, Yu-Ping
    Lan, Shao-Jiang
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2010, 32 (03): : 620 - 623
  • [45] An extended ε-constraint method for a bi-objective assortment optimization problem
    Eskandari, Amin
    Ziarati, Koorush
    Nikseresht, Alireza
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2024, 31 (05) : 3197 - 3219
  • [46] An exact parallel method for a bi-objective permutation flowshop problem
    Lemesre, J.
    Dhaenens, C.
    Talbi, E. G.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (03) : 1641 - 1655
  • [47] An Effective Parameter Tuning for a Bi-objective Genetic Algorithm to Solve the Sum Coloring Problem
    Harrabi, Olfa
    Siala, Jouhaina Chaouachi
    SOFT COMPUTING FOR PROBLEM SOLVING, SOCPROS 2017, VOL 1, 2019, 816 : 107 - 119
  • [48] An algorithm employing the branch-and-bound method to search for pareto solutions of Bi-objective NVP system design problems
    Yamachi, Hidemi
    Yamamoto, Hisashi
    Tsujimura, Yasuhiro
    Kamba Yashi, Yasushi
    Journal of Japan Industrial Management Association, 2007, 58 (01) : 44 - 53
  • [49] Optimal Strategy for Solving a Special Case of the Knapsack Problem by the Branch and Bound Method
    Kolpakov, R. M.
    MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2021, 76 (03) : 97 - 106
  • [50] Optimal Strategy for Solving a Special Case of the Knapsack Problem by the Branch and Bound Method
    R. M. Kolpakov
    Moscow University Mathematics Bulletin, 2021, 76 : 97 - 106
12345