Please enable JavaScript.

Coggle requires JavaScript to display documents.

Mapa 16 - Coggle Diagram

- - - - find the best solution, minimize or maximize some objective function
    - - can avoid nonprimising nodes
    - - Assignment Problem
        
        assigning n people to n jobs so that the total cost od the assignmenet is as small as possible
      - Knapsack Problem
        
        given n items of known weights wi and values vi, i = 1, 2, ..., n, and a knapsack of capacity W, find the most valuable subset of the items that fit in the knapsack.
      - Traveling Salesman Problem
  - - - n-Queens Problem
        
        place n queens on an n x n chessboard so that no two queens attack each other by being in tha same row, column, or diagonal.
      - Hamiltonian Circuit Problem
      - Subsert-Sum Problem
        
        find a subset of a given set of n positive integers whose sum is equal to a given positive integer.