An improved interactive hybrid method for the linear multi-objective knapsack problem

DOI10.1016/S0305-0548(97)00021-XMaRDI QIDQ1374024zbMATH OpenFDO

Authors Kwun Ik Cho, Soung Hie Kim

Publication date 2 December 1997

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

multiple, conflicting objectivesimproved hybrid methodmost preferred solutionstagewise solution process

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Linear programming (90C05) Multi-objective and goal programming (90C29) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 1488081
• scientific article; zbMATH DE number 1784664
• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem
• A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems

Cites work

• scientific article; zbMATH DE number 3891118 (Why is no real title available?)
• scientific article; zbMATH DE number 3908107 (Why is no real title available?)
• An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
• Branch-and-Bound Strategies for Dynamic Programming
• Generalized dynamic programming for multicriteria optimization
• Partial Information, Dominance, and Potential Optimality in Multiattribute Utility Theory
• Preference Order Dynamic Programming
• Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
• Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions
• Solving the Discrete Multiple Criteria Problem using Convex Cones

Cited in

(10)

• scientific article; zbMATH DE number 1784664 (Why is no real title available?)
• Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
• Piecewise \(w^\infty\)-equitable efficiency in multiobjective programming
• Piecewise equitable efficiency in multiobjective programming
• Solving multi-agent knapsack problems using incremental approval voting
• Balancing and optimizing a portfolio of R&D projects
• An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint
• Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation
• A fast interactive solution method for large capital expenditure selection problems
• Fuzzy approach to multilevel knapsack problems

This page was built for publication: An improved interactive hybrid method for the linear multi-objective knapsack problem

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