combinatorial optimization

Subset of mathematical optimization

Conceptacademic discipline academic majorQ1333872

Also known as combinatorial optimisation

Instance of: academic discipline
, academic major
Subclass of: mathematical optimization

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

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.

Overview

All data

13 statements · 23% with external sources · numbers in brackets are citations

Field of work: combinatorial optimisation problem
ACM Classification Code (2012): 10003630

On other databases

9 identifiers linking combinatorial optimization across the web's reference databases

Data quality

statements

23%

externally sourced

Source last edited July 10, 2026. AIDB refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q1333872

API docs, limits & keys

Cite this page

AIDB. (2026). combinatorial optimization (Q1333872). Retrieved from https://aidb.si/e/combinatorial-optimization-Q1333872