Abstract Database queries are one of the most important functions a relational database. Users interested in viewing variety data representations, and this may vary based on database purpose nature stored data. The Air Force Institute Technology has approximately 100 logs which will be converted to standardized Scorpion Data Model format. A is designed house its associated sensor non-sensor met...

The multiple-choice multi-period knapsack problem sits in the interface of multiple choice programming and knapsack problems. Previous studies of this problem had attempted to find its optimal solution through the branch-and-bound procedure using special-ordered-sets. In this paper, we propose another solution approach based on the dynamic programming to locate its optimal solution through the ...

We tackle the thief orienteering problem (ThOP), an academic multi-component that combines two classical combinatorial problems, namely Knapsack Problem and Orienteering Problem. In ThOP, a has time limit to steal items distributed in given set of cities. While traveling, collects by storing them their knapsack, which turn reduces travel speed. The as objective maximize total profit stolen item...

In this paper, we propose a hybrid fine-tuned multiobjective memetic algorithm hybridizing different solution fitness evaluation methods for global exploitation and exploration. To search across all regions in objective space, the algorithm uses a widely diversified set of weights at each generation, and employs a simulated annealing to optimize each utility function. For broader exploration, a...

This paper aims at proposing tractable algorithms to find effectively good solutions to large size chance-constrained combinatorial problems. A new robust model is introduced to deal with uncertainty in mixed-integer linear problems. It is shown to be strongly related to chance-constrained programming when considering pure 0– 1 problems. Furthermore, its tractability is highlighted. Then, an op...

In this paper, we approximately solve the multiple-choice multi-dimensional knapsack problem. We propose a hybrid algorithm based on branch and bound method and Pareto-algebraic operations. The algorithm starts by an initial solution and then combines one-by-one groups of the problem instance to generate partial solutions in each iteration. Most of these partial solutions are discarded by Paret...

This paper presents a new heuristic algorithm for the MultipleChoice Multi-Dimension Knapsack Problem (MMKP) in PRAM model. MMKP is a variant of the classical 0-1 knapsack problem, has a knapsack with multidimensional capacity constraints, groups of items, each item having a utility value and multidimensional resource constraints. The problem is to maximize the total value of the items in the k...