Parallel implementation of an exact two-phase method for the biobjective knapsack problem

DOI10.1051/ro/2024125MaRDI QIDQ6658451

Sadek Bouroubi, Khadidja Chaabane, Younes Djellouli

Publication date: 8 January 2025

Published in: RAIRO. Operations Research (Search for Journal in Brave)

zbMATH Keywords

multi-objective optimizationcombinatorial optimizationefficient solutionCUDAGPU computing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Multi-objective and goal programming (90C29) Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
• Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
• Solving efficiently the 0-1 multi-objective knapsack problem
• Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• A parallel two-list algorithm for the knapsack problem
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
• Solving knapsack problems on GPU
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
• Multiobjective Integer Programming: Synergistic Parallel Approaches
• A New Algorithm for the 0-1 Knapsack Problem
• Bicriteria Transportation Problem
• New reduction strategy in the biobjective knapsack problem
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem

This page was built for publication: Parallel implementation of an exact two-phase method for the biobjective knapsack problem