Multicriteria 0-1 knapsack problems with \(k\)-min objectives
From MaRDI portal
Publication:502471
DOI10.1016/j.cor.2012.10.010zbMath1352.90089OpenAlexW1985639540MaRDI QIDQ502471
Kathrin Klamroth, Aiying Rong, José Rui Figueira
Publication date: 5 January 2017
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.10.010
multiple objective optimizationmultidimensional knapsack problem\(k\)-min objectiveshybrid approaches
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items (3)
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
This page was built for publication: Multicriteria 0-1 knapsack problems with \(k\)-min objectives
