الفهرس 
Abstract
Tabu SearchOnly 14 pages are availabe for public view
 |  | from | 241 |  |  |
| | | from | 241 | | |
Abstract
Optimization problems involving discrete variables are able to describe many real world problems. An Integer programming problem is an optimization problem refers to mathematical programming with discrete variables (zero-one, integer or discrete variables). A particular class of such problem is called integer programming optimization problem which is important but difficult to solve. Different type of problems in economics, science, engineering, traffic, Biology application and medicine can be reformulated as an integer programming problem. So, in this work, we pay a great attention to solve integer programming problems in their two forms: single objective and multi objective of integer programming optimization problems. Global optimization problems represent a main category of such problems. Global optimization refers to finding the extreme value of a given non-convex function in a certain feasible region. Such problems are classified in two classes; unconstrained and constrained problems.