Labeling algorithms for multiple objective integer knapsack problems
From MaRDI portal
Publication:1040971
DOI10.1016/j.cor.2009.06.026zbMath1175.90349OpenAlexW1971983178MaRDI QIDQ1040971
José Rui Figueira, Gabriel Tavares, Margaret M. Wiecek
Publication date: 27 November 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.06.026
Related Items (11)
Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Multiobjective cuckoo search for design optimization ⋮ A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ 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 ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems ⋮ What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods? ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Solving efficiently the 0-1 multi-objective knapsack problem
- Multicriteria dynamic programming with an application to the integer case
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Relocation problems arising in conservation biology
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- Multicriteria Optimization
- Computational Science - ICCS 2004
- AI 2005: Advances in Artificial Intelligence
This page was built for publication: Labeling algorithms for multiple objective integer knapsack problems
