Tutorial by Topics: online

Theory Definition 1: An optimization problem Π consists of a set of instances ΣΠ. For every instance σ∈ΣΠ there is a set Ζσ of solutions and a objective function fσ : Ζσ → ℜ≥0 which assigns apositive real value to every solution. We say OPT(σ) is the value of an optimal solution, A(σ) is the s...
:vglobal or :v is the opposite of :global or :g that operates on lines not matching the specified pattern (inverse).

Page 1 of 1