An extended transportation problem: a DEA-based approach

DOI10.1007/s10100-010-0140-0zbMath1245.90057OpenAlexW2045950441MaRDI QIDQ441020

Alireza Amirteimoori

Publication date: 20 August 2012

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-010-0140-0

zbMATH Keywords

efficiencydata envelopment analysistransportation problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (6)

A novel approach to subgraph selection with multiple weights on arcs ⋮ A new branch and efficiency algorithm for an optimal design of the supply chain network in view of resilience, inequity and traffic congestion ⋮ A two-stage data envelopment analysis approach to solve extended transportation problem with non-homogenous costs ⋮ Resource allocation for branch network system with considering heterogeneity based on DEA method ⋮ An extended shortest path problem: a data envelopment analysis approach ⋮ A data envelopment analysis approach to supply chain efficiency

Cites Work

• Unnamed Item
• Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
• An extended assignment problem considering multiple inputs and outputs
• Programming with linear fractional functionals

This page was built for publication: An extended transportation problem: a DEA-based approach