Needs:
Optimization Problems
Needed by:
None.
Links:
Sheet PDF
Graph PDF

Combinatorial Optimization Problems

Why

Often the feasible set of an optimization problem is set with many, say 2100, objects. Often the size grows exponential in the size of the representation.

Definition

An optimization problem (X,f) is called a combinatorial (a combinatorial optimization problem) if X is a finite set. Usually, the language is meant to connote that the set is large, with respect to some predetermined notion of size.

Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc About Show the old page view