Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation
From MaRDI portal
DOI10.1080/0020739880190612zbMATH Open0662.90079OpenAlexW2095464827MaRDI QIDQ3813622FDOQ3813622
Publication date: 1988
Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020739880190612
Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10)
Cites Work
- A Method of Decomposition for Integer Programs
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
- An algorithm for 0-1 multiple-knapsack problems
- On a generalized bin-packing problem
- Branch and Bound Methods for Multi-Item Scheduling
- An algorithm for a class of loading problems
Cited In (2)
Recommendations
- Mathematical models and decomposition methods for the multiple knapsack problem 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Multiple criteria dynamic programming and multiple knapsack problem 👍 👎
- An improved interactive hybrid method for the linear multi-objective knapsack problem 👍 👎
This page was built for publication: Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813622)