An extended shortest path problem: a data envelopment analysis approach

DOI10.1016/j.aml.2012.02.042zbMath1254.90267OpenAlexW2008046122MaRDI QIDQ712615

Alireza Amirteimoori

Publication date: 17 October 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2012.02.042

zbMATH Keywords

efficiencyDEAshortest path probleminput/output

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

A two-stage data envelopment analysis approach to solve extended transportation problem with non-homogenous costs, Unnamed Item

Cites Work

• Measuring the efficiency of decision making units
• An extended transportation problem: a DEA-based approach
• An extended assignment problem considering multiple inputs and outputs
• Programming with linear fractional functionals
• Unnamed Item
• Unnamed Item
• Unnamed Item