New perspectives on multi-objective knapsack problems

zbMATH Open1404.90124MaRDI QIDQ4601004FDOQ4601004

Authors: Britta Schulze 

Publication date: 18 January 2018

Recommendations

• scientific article; zbMATH DE number 1830735
• scientific article; zbMATH DE number 1149800
• Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
• Approximating multiobjective knapsack problems
• The multiobjective multidimensional knapsack problem: a survey and a new approach

zbMATH Keywords

combinatorial optimizationmulti-objective optimizationknapsack problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (6)

• The multiobjective multidimensional knapsack problem: a survey and a new approach
• Bi-dimensional knapsack problems with one soft constraint
• Advancing local search approximations for multiobjective combinatorial optimization problems
• Title not available (Why is that?)
• Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
• Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem

This page was built for publication: New perspectives on multi-objective knapsack problems

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