Integer Integer An integer (from the Latin "integer" meaning "whole") is a number that can be written without a fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, , and are not. The set of integers consists of zero (), the positive natural numbers (, , , …), also called "whole numbers" or "counting numbers", and their additive inverses (the negative integers, i.e., −1, −2, −3, …). The set of integers is often denoted by a boldface Z ("") or blackboard bold formula_1 (Unicode U+2124 ℤ) standing for the German word "Zahlen" (, "numbers"). The integers form
Integer programming far from optimality the returned solution is. Finally, branch and bound methods can be used to return multiple optimal solutions. Lenstra in 1983 showed that, when the number of variables is fixed, the feasibility integer programming problem can be solved in polynomial time. Since integer linear programming is NP-hard, many problem instances are intractable and so heuristic methods must be used instead. For example, tabu search can be used to search for solutions to ILPs. To use tabu search to solve ILPs, moves can be defined as incrementing or decrementing an integer constrained variable of a feasible solution, while keeping