The Binary Integer Programming problem (BIP) is a mathematical optimization problem, with linear objective function and constraints, on which the domain of all variables {0, 1}. In BIP, every variable associated determined cost coefficient. Minmax regret under interval uncertainty (M-BIP) generalization BIP in coefficient to not known advance, but are assumed be bounded by an interval. M-BIP fi...

We introduce a general class of time discounting, which includes time-inconsistent ones, into repeated games with perfect monitoring. A strategy profile is called an agent subgame perfect equilibrium if there is no profitable one-shot deviation at any history. We characterize strongly symmetric agent subgame perfect equilibria for repeated games with symmetric stage game. We find that the harsh...

Dept. Of Comp. Sci. & Eng. Vaagdevi college of Eng. Warangal, India [email protected] Abstract Frequent pattern mining is an important area of data mining used to generate the Association Rules. The extracted Frequent Patterns quality is a big concern, as it generates huge sets of rules and many of them are redundant. Mining Non-Redundant Frequent patterns is a big concern in the area of Ass...

Received: 1 June 2015 Abstract Accepted: 30 July 2015 The uncertain flow-shop is considered. It is assumed that processing times are not given a priori, but they belong to intervals of known bounds. The absolute regret (regret) is used to evaluate a solution (a schedule) which gives the minmax regret binary optimization problem. The evolutionary heuristic solution algorithm is experimentally co...

We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal) solution preserves optimality was obtained. MSC: 90C29, 90C31