Multicriteria 0-1 knapsack problems with k-min objectives
DOI10.1016/J.COR.2012.10.010zbMATH Open1352.90089OpenAlexW1985639540MaRDI QIDQ502471FDOQ502471
Authors: Aiying Rong, Kathrin Klamroth, 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
Recommendations
- Solving efficiently the 0-1 multi-objective knapsack problem
- An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- Approximating multiobjective knapsack problems
- scientific article; zbMATH DE number 1830735
- \(0\)-\(1\) knapsack problems
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
multiple objective optimizationmultidimensional knapsack problem\(k\)-min objectiveshybrid approaches
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Boolean programming (90C09)
Cited In (7)
- A new evolutionary algorithm for the multiobjective \(0/1\) knapasck problem
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Solving efficiently the 0-1 multi-objective knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502471)
