On a particular case of the multi-criteria unconstrained optimization problem

DOI10.1016/J.ENDM.2010.05.018MaRDI QIDQ2883560zbMATH OpenOpenAlexFDO

Authors Jochen Gorski, Luís Paquete

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

zbMATH Keywords

binary optimizationconnectednessknapsack problemmulti-criteria unconstrained optimization

Mathematics Subject Classification ID

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

Recommendations

• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• Connectedness of efficient solutions in multiple objective combinatorial optimization
• Combinatorial optimization problems with two and three criteria
• scientific article; zbMATH DE number 4191411
• scientific article; zbMATH DE number 1098952

Cites work

• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• Connectedness of efficient solutions in multiple objective combinatorial optimization
• Greedy algorithms for a class of knapsack problems with binary weights
• On Finding the Maxima of a Set of Vectors
• On local optima in multiobjective combinatorial optimization problems
• Solving sequential knapsack problems

This page was built for publication: On a particular case of the multi-criteria unconstrained optimization problem

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