💡 Words with a Similar Meaning to "Generalized assignment problem"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| assignment problem | The assignment problem is a fundamental combinatorial optimization problem. |
| metric k-center | In graph theory, the metric -center problem or vertex k-center problem is a classical combinatorial optimization problem studied in theoretical computer science that is NP-hard. |
| maximum weight matching | In computer science and graph theory, the maximum weight matching problem is the problem of finding, in a weighted graph, a matching in which the sum of weights is maximized. |
| 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. |
| maximum coverage problem | The maximum coverage problem is a classical question in computer science, computational complexity theory, and operations research. |
| combinatorial optimization | a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects,. |
| basis pursuit denoising | In applied mathematics and statistics, basis pursuit denoising refers to a mathematical optimization problem of the form |
| optimizationnoun | The design and operation of a system or process to make it as good as possible in some defined sense. |
| longest path problem | In graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph. |
| quadratic programming | the process of solving certain mathematical optimization problems involving quadratic functions. |
| steiner tree problem | In combinatorial mathematics, the Steiner tree problem, or minimum Steiner tree problem, named after Jakob Steiner, is an umbrella term for a class of problems in combinatorial optimization. |
| global optimization | a branch of applied mathematics and numerical analysis that attempts to find the global minima or maxima of a function or a set of functions on a given set. |
| discrete optimization | a branch of optimization in applied mathematics and computer science. |
| convex optimization | a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently, maximizing concave functions over convex sets). |
| job-shop scheduling | Job-shop scheduling, the job-shop problem or job-shop scheduling problem is an optimization problem in computer science and operations research. |
| computational problem | In theoretical computer science, a computational problem is one that asks for a solution in terms of an algorithm. |
| matrix chain multiplication | (or the matrix chain ordering problem) an optimization problem concerning the most efficient way to multiply a given sequence of matrices. |
| 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. |
| arithmetic combinatoricsnoun | (mathematics) A field of mathematics in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis. |
| linear-fractional programming | In mathematical optimization, linear-fractional programming is a generalization of linear programming. |
Translate “Generalized assignment problem” into Another Language
Pick a language — the word will be pre-filled in the translator.