Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desig...

The airline crew scheduling problem is the problem of assigning crew itineraries to flights. We develop a new approach for solving the problem that is based on enumerating hundreds of millions random pairings. The linear programming relaxation is solved first and then millions of columns with best reduced cost are selected for the integer program. The number of columns is further reduced by a l...

This paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. First, the problem is formulated as a mixed integer linear programming model. Then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. Two experiments are carried out to evaluate th...

<span>Privacy preserving data mining has become the focus of attention government statistical agencies and database security research community who are concerned with preventing privacy disclosure during mining. Repositories large datasets include sensitive rules that need to be concealed from unauthorized access. Hence, association rule hiding emerged as one powerful techniques for knowl...

In this paper, we propose an integer linear programming model whose solutions are the aperiodic rhythms tiling with a given rhythm A. We show how it can be used to define iterative algorithm that, period n, finds all which tile A and also efficiently check necessity of Coven-Meyerowitz condition (T2). To conclude, run several experiments validate time efficiency model.

Corner Polyhedra are a natural intermediate step between linear programming and integer programming. This paper first describes how the concept of Corner Polyhedra arose unexpectedly from a practical operations research problem, and then describes how it evolved to shed light on fundamental aspects of integer programming and to provide a great variety of cutting planes for integer programming. ...