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 条
  • [21] A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy
    Li, Hongming
    Li, Xintao
    MATHEMATICS, 2022, 10 (24)
  • [22] A comparison among optimization software to solve bi-objective sectorization problem
    Teymourifar, Aydin
    HELIYON, 2023, 9 (08)
  • [23] Exact and heuristic methods to solve a bi-objective problem of sustainable cultivation
    Angelo Aliano Filho
    Helenice de Oliveira Florentino
    Margarida Vaz Pato
    Sônia Cristina Poltroniere
    João Fernando da Silva Costa
    Annals of Operations Research, 2022, 314 : 347 - 376
  • [24] Exact and heuristic methods to solve a bi-objective problem of sustainable cultivation
    Aliano Filho, Angelo
    de Oliveira Florentino, Helenice
    Pato, Margarida Vaz
    Poltroniere, Sonia Cristina
    da Silva Costa, Joao Fernando
    ANNALS OF OPERATIONS RESEARCH, 2022, 314 (02) : 347 - 376
  • [25] Efficient anytime algorithms to solve the bi-objective Next Release Problem
    Angel Dominguez-Rios, Miguel
    Chicano, Francisco
    Alba, Enrique
    del Aguila, Isabel
    del Sagrado, Jose
    JOURNAL OF SYSTEMS AND SOFTWARE, 2019, 156 : 217 - 231
  • [26] Solving Knapsack Problem: Postoptimality Analysis and Branch and Bound Method
    Mikhailyuk, V. A.
    JOURNAL OF AUTOMATION AND INFORMATION SCIENCES, 2011, 43 (11) : 48 - 56
  • [27] APPLICATION OF METHOD BRANCH AND BOUND FOR A GENERALIZED KNAPSACK-PROBLEM
    KRAWCZYK, R
    ANGEWANDTE INFORMATIK, 1971, 13 (10): : 461 - &
  • [28] A two state reduction based dynamic programming algorithm for the bi-objective 0-1 knapsack problem
    Rong, Aiying
    Figueira, Jose Rui
    Pato, Margarida Vaz
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2011, 62 (08) : 2913 - 2930
  • [29] Two phase algorithms for the bi-objective assignment problem
    Przybylski, Anthony
    Gandibleux, Xavier
    Ehrgott, Matthias
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 185 (02) : 509 - 533
  • [30] Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
    Asmaa Khoudi
    Ali Berrichi
    Operational Research, 2020, 20 : 1763 - 1789
12345