Cargando…
Combinatorial Efficiency Evaluation: The Knapsack Problem in Data Envelopment Analysis
The traditional data envelopment analysis (DEA) literatures generally concentrated on the efficiency evaluation of single decision making unit (DMU). However, in many practical problems, the decision makers are required to choose a number of DMUs instead of a single one from the DMUs set. Therefore,...
Autores principales: | Qi, Xiao-guang, Guo, Bo |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi Publishing Corporation
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4119746/ https://www.ncbi.nlm.nih.gov/pubmed/25114971 http://dx.doi.org/10.1155/2014/789053 |
Ejemplares similares
-
Knapsack problems
por: Kellerer, Hans, et al.
Publicado: (2004) -
Correction to: The Knapsack Problem with Forfeits
por: Cerulli, Raffaele, et al.
Publicado: (2020) -
Exact solution of the robust knapsack problem()
por: Monaci, Michele, et al.
Publicado: (2013) -
An efficient optimizer for the 0/1 knapsack problem using group counseling
por: Ghadi, Yazeed Yasin, et al.
Publicado: (2023) -
Flexible Wolf Pack Algorithm for Dynamic Multidimensional Knapsack Problems
por: Wu, Husheng, et al.
Publicado: (2020)