Combinatorial optimization
Subset of mathematical optimization
Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem.
Nº Q1333872 ★
Common · Knowledge
Combinatorial optimization
Subset of mathematical optimization
Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem.
From Wikipedia
Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously mentioned, exhaustive search is not tractable, and so specialized algorithms that quickly rule out large parts of the search space or approximation algorithms must be resorted to instead. Combinatorial optimization is related to operations research, algorithm theory, and computational complexity theory. It has important applications in several fields, including artificial intelligence, machine learning, auction theory, software engineering, VLSI, applied mathematics and theoretical computer science.
Text: Wikipédia, CC BY-SA 4.0. · Image: No machine-readable author provided. Dcoetzee assumed (based... (Public domain) ·
Related cards
-
Optimization problem
Problems involving the selection of an optimal element from sets of available alternatives
Nº Q984063 ★★
Not listed
-
Mathematical optimization
Study of mathematical algorithms for optimization problems
Nº Q141495 ★★★
Not listed
-
Lagrange multiplier
A method to solve constrained optimization problems
Nº Q598870 ★★★
Not listed
-
P
Process optimization
Adjusting a process
Nº Q332172 ★
Not listed
-
Topology optimization
Mathematical method for optimizing material layout under given conditions
Nº Q2443456 ★
Not listed
-
Combinatorics
Branch of discrete mathematics
Nº Q76592 ★★★
Not listed