Identifying the global reference set in DEA: a mixed 0-1 LP formulation with an equivalent LP relaxation.
Mahmood MehdiloozadPublished in: Oper. Res. (2017)
Keyphrases
- lp relaxation
- reference set
- linear programming
- linear program
- message passing
- integer program
- optimal solution
- knapsack problem
- integer programming
- feasible solution
- energy minimization
- integer programming formulation
- valid inequalities
- maximum a posteriori
- global constraints
- subtour elimination
- background knowledge
- column generation
- semi automatically
- dynamic programming
- map estimation
- branch and bound
- graph cuts
- objective function
- image segmentation
- convex hull
- belief propagation
- energy function
- markov random field
- np hard
- search algorithm
- set partitioning
- feature extraction