Combinatorial optimization
id:
combinatorial-optimization-207-3641506
title:
Combinatorial optimization
text:
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 specializ
brand slug:
wiki
category slug:
encyclopedia
description:
Subfield of mathematical optimization
original url:
https://en.wikipedia.org/wiki/Combinatorial_optimization
date created:
2004-01-04T20:46:26Z
date modified:
2024-09-10T22:39:42Z
main entity:
{"identifier":"Q1333872","url":"https://www.wikidata.org/entity/Q1333872"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d2/Minimum_spanning_tree.svg","width":300,"height":242}
fields total:
13
integrity:
16