Integer programming studies linear programs in which some or all incertain are constrained to take nous-mêmes integer values. This is not convex, and in general much more difficult than regular linear programming. Heuristics and metaheuristics make few or no assumptions about the problem being optimized. Usually, heuristics do not guarantee https://henryd801soy0.wikigdia.com/user