Integer Programming
Integer programming mathematical programming is the section in which some or all variables are constrained integer addition. The simplest method for solving integer programming problem is reducing it to a linear programming problem with a test result to an integer. For the special case of integer linear programming problem are problems where the variables X can take only two values - 0 and 1. The corresponding tasks are often called Boolean programming tasks. The most famous of these tasks - assignment problem (of the employee to put some work), the task of selecting a route (traveling salesman problem, the Continue reading...