Pages that link to "Item:Q1936797"
From MaRDI portal
The following pages link to An enumerative algorithm for solving nonconvex dynamic DEA models (Q1936797):
Displaying 14 items.
- Network data envelopment analysis: a review (Q297047) (← links)
- Identification of the anchor points in FDH models (Q319903) (← links)
- A polynomial-time algorithm for finding \(\varepsilon\) in DEA models (Q1433173) (← links)
- Hybrid dynamic network data envelopment analysis (Q1723607) (← links)
- Cost-efficiency under inter-temporal dependence (Q2241142) (← links)
- Inverse DEA under inter-temporal dependence using multiple-objective programming (Q2629649) (← links)
- AN EXTENDED NUMERATION METHOD FOR SOLVING FREE DISPOSAL HULL MODELS IN DEA (Q3607429) (← links)
- (Q4359111) (← links)
- A review of Dynamic Data Envelopment Analysis: state of the art and applications (Q4642110) (← links)
- Nonparametric cost and revenue functions under constant economies of scale: an enumeration approach for the single output or input case (Q5175830) (← links)
- A generalized DEA model for inputs (outputs) estimation under inter-temporal dependence (Q5214331) (← links)
- SOLUTION METHODS FOR NONCONVEX FREE DISPOSAL HULL MODELS: A REVIEW AND SOME CRITICAL COMMENTS (Q5411736) (← links)
- Dynamic network data envelopment analysis based upon technology changes (Q5884363) (← links)
- Multi-choice conic goal programming model-based network data envelopment analysis (Q6658460) (← links)