Combinatorial optimization

Subset of mathematical optimization

Last price

—

Floor price

—

7-day median

—

30-day sales

30-day range

—

In circulation

Price history

Show table

Date	median	Low	High	sales

Sales history

Last sale: —
30-day average: —
30-day low: —
30-day high: —
Sales 7d: 0
Sales 30d: 0

No sales yet.

Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.

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) ·