The Dominating Set problem
Find the minimum dominating set of a weighted graph, so that the sum of edges connected to the nodes in the dominating set is not less than a bound. 

Knapsack problem
Select items to include in a knapsack so that the total weight is within a given limit and the total value is as large as possible. 

The subset sum problem
Find a minimum subset from a set of numbers so that the summation of the numbers in the subset equals to a given target number. 

Traveling sales person problem
Find a shortest Hamiltonian cycle in a weighted directed graph.

WareHouse problem
There is a set of customers who need to be assigned to one of several potential warehouse. Each customer can only be assigned to an open warehouse with an opening cost. Each warehouse can serve arbitrary number of customers with service cost. The goal to assign each customer a warehouse that minimize the overall costs.

The job Shop problem
We are given a number of tasks, amount of resources and a deadline. Each task is associated with a duration that it takes to complete and amount of resources that it takes up during the execution. The goal is to find a schedule for the tasks that guarantees every task be finished before the deadline.

Newspaper problem 
We are given a number of persons and newspaper. Each person spends different amount of time when reading different newspapers, due to his or her interests. The goal of is to find a schedule for the persons to read the newspapers such that every person finishes all the newspapers before a deadline while guaranteeing that no newspaper is read by more than one person and a person read at most one newspaper at a time.

Sorting problem
Sort a set of numbers in increasing order.

RoutingMax 
We have a network consisting of nodes connected by edges. Each edge has some delay in transmitting a packet along the edge and some profit that can be gained by transmitting a packet. Some nodes are critical and each of critical nodes is associated a deadline. The goal is to find a route to transmit a packet, so that each critical node is reached by the packet within the deadline and the profit of transmitting the packet on a route is maximized.

RoutingMin
Similar to RoutingMax. The difference is that there is no profit associate to the edges and the goal is to minimize the total delay of a route for a packet while guaranteeing that the packet reach every critical node.  
