n instance of a combinatorial optimization problem is defined by a finite ground set E = { 0,..., n}, a set of feasible solutions F ⊆ 0 E , and an objective function ![ $$f: 0^{E} \\rightarrow \\mathbb{R}$$ ](A000000_0_En_0_Chapter_IEq0.gif)