Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...

The conventional data envelopment analysis (DEA) assumes that the inputs and outputs are real values. However, in many real world instances, some inputs and outputs must be in integer values. While integer-valued DEA models have been proposed, the current paper develops an integer-valued DEA super-efficiency model. Super-efficiency DEA models are known to have the problem of infeasibility. Rece...

Abstract The paper presents a new mixed-integer programming formulation for the maximally diverse grouping problem (MDGP) with attribute values. MDGP is of assigning items to groups such that all are as heterogeneous possible. In version values, heterogeneity measured by sum pairwise absolute differences values assigned items, i.e. Manhattan metric. advantage objective function can be reformula...

In this paper we present several algorithms which combine a partial enumeration with meta-heuristics for the solution of general mixed-integer programming problems. The enumeration is based on the primal values assignable to the integer variables of the problem. We develop some algorithms for this integration, and test them using a set of well-known benchmark problems. Key-words: Enumeration, L...