On a particular case of the multi-criteria unconstrained optimization problem
From MaRDI portal
Publication:2883560
DOI10.1016/j.endm.2010.05.018zbMath1237.90193OpenAlexW2019702756MaRDI QIDQ2883560
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.018
Cites Work
- Connectedness of efficient solutions in multiple objective combinatorial optimization
- Solving sequential knapsack problems
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- Greedy algorithms for a class of knapsack problems with binary weights
- On local optima in multiobjective combinatorial optimization problems
- On Finding the Maxima of a Set of Vectors