💡 Words with a Similar Meaning to "Integer programming"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| branch and cut | a method of combinatorial optimization for solving integer linear programs (ILPs), that is, linear programming problems where some or all the unknowns are restricted to integer values. |
| quadratic programming | the process of solving certain mathematical optimization problems involving quadratic functions. |
| optimization problemnoun | (mathematics) The problem of finding the "best" solution from all feasible solutions, given constraints defining which of the solutions are feasible, and a goal function defining which of the feasible solutions is the best one. |
| sum-of-squares optimization | A sum-of-squares optimization program is an optimization problem with a linear cost function and a particular type of constraint on the decision variables. |
| diophantine equationnoun | (number theory) A polynomial equation whose variables are only permitted to assume integer values. |
| nonlinear programming | In mathematics, nonlinear programming is the process of solving an optimization problem where some of the constraints are not linear equalities or the objective function is not a linear function. |
| combinatorial optimization | a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects,. |
| constrained optimization | In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function with respect to some variables in the presence of constraints on those variables. |
| computational problem | In theoretical computer science, a computational problem is one that asks for a solution in terms of an algorithm. |
| semidefinite programming | a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified function that the user wants to minimize or maximize) |
| constraintnoun | Something that constrains; a restriction. |
| mathematical problem | A mathematical problem is a problem that can be represented, analyzed, and possibly solved, with the methods of mathematics. |
| branch and price | In applied mathematics, branch and price is a method of combinatorial optimization for solving integer linear programming and mixed integer linear programming problems with many variables. |
| non-negative least squares | In mathematical optimization, the problem of non-negative least squares is a type of constrained least squares problem where the coefficients are not allowed to become negative. |
| linear programming relaxation | In mathematics, the relaxation of a (mixed) integer linear program is the problem that arises by removing the integrality constraint of each variable. |
| constraint programming | a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer science, and operations research. |
| integernoun | (arithmetic) A number that is not a fraction; an element of the infinite and numerable set {..., -3, -2, -1, 0, 1, 2, 3, ...}. |
| search problem | In the mathematics of computational complexity theory, computability theory, and decision theory, a search problem is a type of computational problem represented by a binary relation. |
| linear-fractional programming | In mathematical optimization, linear-fractional programming is a generalization of linear programming. |
| assignment problem | The assignment problem is a fundamental combinatorial optimization problem. |
Translate “Integer programming” into Another Language
Pick a language — the word will be pre-filled in the translator.