Topic outline

  • General

  • Topic 1

  • Topic 2

    • - Algorithme Glouton pour le Sac à Dos (KP 0,1)

      - Algorithme de Programmation Dynamique (KP 0,1)

      - Bounded Knapsack Problem (BKP)

      - Transformation  d'un BKP en KP(0,1)

  • Topic 4

  • Topic 6

      • A description of the steiner tree problem is available in the pdf file. Also, the detail about KMB heuristic is already present at the level of the same pdf file.

      • For the instances on which you can run your algorithms, you can find them in the file "Instances"

      • The features to be implemented are:

      1. A graphical User interface to visualize the instances (the graphs) and their solutions.

      2. An implementation of KMB heuristic.

      3. The implementation of Kruskal's algorithm as a separated function.

      4. The implementation of Djikstra algorithm also as a separated function.


  • Topic 7

  • Topic 8

  • Topic 9

  • Topic 10

  • Topic 11

  • Topic 12

  • Topic 13

  • Topic 14

  • Topic 15

  • Topic 16

  • Topic 17

  • Topic 18

  • Topic 19

  • Topic 20