Labeling algorithms for multiple objective integer knapsack problems

DOI10.1016/J.COR.2009.06.026zbMATH Open1175.90349OpenAlexW1971983178MaRDI QIDQ1040971FDOQ1040971

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

Recommendations

• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Finding all nondominated points of multi-objective integer programs
• Approximating multiobjective knapsack problems
• Multicriteria 0-1 knapsack problems with \(k\)-min objectives
• scientific article; zbMATH DE number 1423920

zbMATH Keywords

shortest path problemlabeling algorithmsmultiple objective integer knapsack problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Multicriteria dynamic programming with an application to the integer case
• Title not available (Why is that?)
• Multicriteria Optimization
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
• Relocation problems arising in conservation biology
• A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
• Solving efficiently the 0-1 multi-objective knapsack problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
• Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational Science - ICCS 2004
• AI 2005: Advances in Artificial Intelligence

Cited In (13)

• Dynamic programming algorithms for the bi-objective integer knapsack problem
• 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
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Multiobjective cuckoo search for design optimization
• Algorithms for the multiple label placement problem
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Network Models for Multiobjective Discrete Optimization
• What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods?
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

This page was built for publication: Labeling algorithms for multiple objective integer knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040971)