An improved interactive hybrid method for the linear multi-objective knapsack problem
From MaRDI portal
Publication:1374024
DOI10.1016/S0305-0548(97)00021-XzbMath0889.90093MaRDI QIDQ1374024
Publication date: 2 December 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
multiple, conflicting objectivesimproved hybrid methodmost preferred solutionstagewise solution process
Multi-objective and goal programming (90C29) Linear programming (90C05) Management decision making, including multiple objectives (90B50) Dynamic programming (90C39)
Related Items (5)
Fuzzy approach to multilevel knapsack problems ⋮ Piecewise \(w^\infty\)-equitable efficiency in multiobjective programming ⋮ Balancing and optimizing a portfolio of R&D projects ⋮ An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint ⋮ Piecewise equitable efficiency in multiobjective programming
Cites Work
- Unnamed Item
- Unnamed Item
- Generalized dynamic programming for multicriteria optimization
- Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions
- Partial Information, Dominance, and Potential Optimality in Multiattribute Utility Theory
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
- Preference Order Dynamic Programming
- Branch-and-Bound Strategies for Dynamic Programming
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
This page was built for publication: An improved interactive hybrid method for the linear multi-objective knapsack problem