PARALLEL NETWORK COMPUTING APPROACH FOR DEA-RAM MEASUREMENT
From MaRDI portal
Publication:4650619
DOI10.1142/S0217595904000060zbMath1056.90104OpenAlexW1966414216MaRDI QIDQ4650619
Toshiyuki Sueyoshi, Shiuh-Nan Hwang
Publication date: 18 February 2005
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595904000060
Large-scale problems in mathematical programming (90C06) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (2)
EVALUATING THE PERFORMANCE OF THE TAIWANESE HOTEL INDUSTRY USING A WEIGHT SLACKS-BASED MEASURE ⋮ DOES SIZE MATTER? FINDING THE PROFITABILITY AND MARKETABILITY BENCHMARK OF FINANCIAL HOLDING COMPANIES
Uses Software
Cites Work
- Unnamed Item
- Efficient algorithm for additive and multiplicative models in data envelopment analysis
- 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
- A Special Algorithm for an Additive Model in Data Envelopment Analysis
- Measuring Technical, Allocative and Overall Efficiencies Using a DEA Algorithm
- Measuring Efficiencies and Returns to Scale of Nippon Telegraph & Telephone in Production and Cost Analyses
- Divestiture of Nippon Telegraph and Telephone
- DEA Duality on Returns to Scale (RTS) in Production and Cost Analyses: An Occurrence of Multiple Solutions and Differences Between Production-Based and Cost-Based RTS Estimates
- Extended DEA-discriminant analysis
This page was built for publication: PARALLEL NETWORK COMPUTING APPROACH FOR DEA-RAM MEASUREMENT