Exact algorithm for bi-objective 0-1 knapsack problem
DOI10.1016/J.AMC.2007.04.062zbMATH Open1193.90011OpenAlexW2058891234MaRDI QIDQ990717FDOQ990717
Authors: M. J. Rezaee, Pariviz Fattahi, Fariborz Jolai, M. Rabbani, Jafar Razmi 
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
Recommendations
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- Solving efficiently the 0-1 multi-objective knapsack problem
- An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem
- Dynamic programming algorithms for the bi-objective integer knapsack problem
Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Boolean programming (90C09)
Cites Work
- Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
- Title not available (Why is that?)
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A method for generating all efficient solutions of 0-1 multi-objective linear programming problem
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Solving zero-one multiple objective programs through implicit enumeration
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs
Cited In (14)
- An exact algorithm for bilevel 0-1 knapsack problems
- The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
- Title not available (Why is that?)
- On the Dietrich-Escudero approach for solving the \(0-1\) knapsack problem with a \(0-1\) objective function
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- New reduction strategy in the biobjective knapsack problem
Uses Software
This page was built for publication: Exact algorithm for bi-objective 0-1 knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990717)
