An improved interactive hybrid method for the linear multi-objective knapsack problem
DOI10.1016/S0305-0548(97)00021-XzbMATH Open0889.90093MaRDI QIDQ1374024FDOQ1374024
Authors: Kwun Ik Cho, Soung Hie Kim 
Publication date: 2 December 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
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
multiple, conflicting objectivesimproved hybrid methodmost preferred solutionstagewise solution process
Management decision making, including multiple objectives (90B50) Linear programming (90C05) Multi-objective and goal programming (90C29) Dynamic programming (90C39)
Cites Work
- Generalized dynamic programming for multicriteria optimization
- Partial Information, Dominance, and Potential Optimality in Multiattribute Utility Theory
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- Title not available (Why is that?)
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
- Preference Order Dynamic Programming
- Branch-and-Bound Strategies for Dynamic Programming
- Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions
- Title not available (Why is that?)
Cited In (10)
- Balancing and optimizing a portfolio of R&D projects
- Title not available (Why is that?)
- A fast interactive solution method for large capital expenditure selection problems
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint
- Solving multi-agent knapsack problems using incremental approval voting
- Fuzzy approach to multilevel knapsack problems
- Piecewise \(w^\infty\)-equitable efficiency in multiobjective programming
- Piecewise equitable efficiency in multiobjective programming
- Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
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)
