DEA network computing in multi-stage parallel processes

DOI10.1111/1475-3995.00405zbMath1087.90517OpenAlexW2019678434MaRDI QIDQ3044035

Takashi Honma, Toshiyuki Sueyoshi

Publication date: 10 August 2004

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00405

zbMATH Keywords

DEAlocal area networknetwork computing

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Measuring the efficiency of decision making units
• Streamlined computation for data envelopment analysis
• Efficient algorithm for additive and multiplicative models in data envelopment analysis
• A benchmark approach for baseball evaluation
• An enhanced DEA Russell graph efficiency measure
• Privatization of nippon telegraph and telephone: Was it a good policy decision?
• Parallel and hierarchical decomposition approaches for solving large-scale data envelopment analysis models
• Computational Accuracy and Infinitesimals In Data Envelopment Analysis
• Extended DEA-discriminant analysis

This page was built for publication: DEA network computing in multi-stage parallel processes