Research Article
Combinatorial Efficiency Evaluation: The Knapsack Problem in Data Envelopment Analysis
Pseudocode 1
The pseudocode of the basic local search algorithm.
Generate an initial solution ; | ; | ; | for from 1 to | generate (part of) the neighborhood of ; | the best solution in (part of) the neighborhood of ; | if | ; | else if | generate another initial solution ; | end if | if | ; | end if | end for | return |
|