Exact algorithm for bi-objective 0-1 knapsack problem

DOI10.1016/j.amc.2007.04.062zbMath1193.90011OpenAlexW2058891234MaRDI QIDQ990717

M. J. Rezaee, Pariviz Fattahi, Jafar Razmi, Masoud Rabbani, Fariborz Jolai

Publication date: 1 September 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.04.062

zbMATH Keywords

linear programmingbi-objective 0-1 knapsack problemmultiple objective mathematical programming

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (7)

Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems ⋮ A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem ⋮ Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems ⋮ Solving 0-1 knapsack problems based on amoeboid organism algorithm ⋮ Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
• Solving zero-one multiple objective programs through implicit enumeration
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A method for generating all efficient solutions of 0-1 multi-objective linear programming problem
• Theory and algorithms for linear multiple objective programs with zero–one variables

This page was built for publication: Exact algorithm for bi-objective 0-1 knapsack problem