Optimal Paths And Costs Of Adjustment In Dynamic DEA Models: With Application To Chilean Department Stores

Author： Mateo Filadelfo   Coelli Tim   O'Donnell Chris  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.145, Iss.1, 2006-07, pp. : 211-227

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimal binary search trees with costs depending on the access paths

By Szwarcfiter J.L.   Navarro G.   Baeza-Yates R.   Oliveira J.d.S.   Cunto W.   Ziviani N.  

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1799-1814

Elsevier

Access to resources Recommend Favorite

A Decomposition Scheme for System Optimal Dynamic Traffic Assignment Models

By Li Yue   Waller S. Travis   Ziliaskopoulos Thanasis  

Networks and Spatial Economics, Vol. 3, Iss. 4, 2003-12 ,pp. : 441-455

Springer Publishing Company

Access to resources Recommend Favorite

Ownership-specified network DEA models

By Chang Tsung-Sheng   Tone Kaoru   Wei Quanling  

Annals of Operations Research, Vol. 214, Iss. 1, 2014-03 ,pp. : 73-98

Springer Publishing Company

Access to resources Recommend Favorite

DEA and benchmarks – an application to Nordic banks

By Bergendahl G.  

Annals of Operations Research, Vol. 82, Iss. 1, 1998-01 ,pp. : 233-250

Springer Publishing Company

Access to resources Recommend Favorite

Finding optimal paths in MREP routing

By Fleischer R.   Golin M.   Lea C.-T.   Wong S.  

Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. : 57-63

Elsevier

Access to resources Recommend Favorite