Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems

DOI10.1016/j.cor.2017.08.008zbMath1391.90545OpenAlexW2749049297MaRDI QIDQ1652447

José Rui Figueira, Pedro Correia, Luís Paquete

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.08.008

zbMATH Keywords

multi-objective optimizationimplicit enumeration techniques

Mathematics Subject Classification ID

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

Related Items (2)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Decision space robustness for multi-objective integer linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
• On a biobjective search problem in a line: formulations and algorithms
• Bound sets for biobjective combinatorial optimization problems
• Solving efficiently the 0-1 multi-objective knapsack problem
• Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Discrete Optimization with Decision Diagrams
• An Evolutionary Metaheuristic for Approximating Preference-Nondominated Solutions
• A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
• Approximating Multiobjective Knapsack Problems
• Cost-Bounded Binary Decision Diagrams for 0-1 Programming
• Storage Reduction Through Minimal Spanning Trees and Spanning Forests
• Binary Decision Diagrams
• Parametric Solution for Linear Bicriteria Knapsack Models
• A hybrid dynamic programming approach to the biobjective binary knapsack problem
• 0/1 vertex and facet enumeration with BDDs
• Multicriteria Optimization
• Experimental and Efficient Algorithms

This page was built for publication: Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems