ABSTRACT
Typically, a combinatorial optimization problem involves a set E https://s3-euw1-ap-pe-df-pch-content-public-u.s3.eu-west-1.amazonaws.com/9781351236423/7ef10423-eda9-42b3-a9ea-761fc7500b5b/content/equ_9404.tif"/> of elements (called ground set) and the goal is to arrange, group, order, or select a subset of elements from E https://s3-euw1-ap-pe-df-pch-content-public-u.s3.eu-west-1.amazonaws.com/9781351236423/7ef10423-eda9-42b3-a9ea-761fc7500b5b/content/equ_9405.tif"/> that optimizes a given objective function. Classical examples of combinatorial optimization problems include the minimum spanning tree problem, the shortest paths problem, and the traveling salesman problem [1].
