SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Combinatorial Optimization Homework: Choose Your Project Path

ferrol avatar
ferrol
4 diapositives · 186 Views · Jul 26, 2014

This homework assignment offers three distinct paths for completion: Programming, Theory, or Reading and Presentation. For the Programming option, you will develop an algorithm from class, such as graph coloring or solving Boolean equations. The Theory option requires you to create a new algorithm related to our topics. Lastly, if you choose Reading, you will find a research paper related to combinatorial optimization and present it in class. All work must be documented in English, with opportunities for further research leading to publications.

Combinatorial Optimization Homework: Choose Your Project Path - slide 1
01 / 4Combinatorial Optimization Homework: Choose Your Project Path
1 / 17

Télécharger la présentation

Combinatorial Optimization Homework: Choose Your Project Path
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Homework number One • You have two weeks to complete this homework • You can choose one of three possibilities • 1. Programming. • 2. Theory. • 3. Reading and presenting.

  2. In case you selected programming option • Your task is to write a program in any language of your choice that will implement any algorithm presented in the class, such as: • 1. Set covering (unate covering) • 2. Solving Boolean equations • 3. Solving Petrick Function • 4. Graph Coloring • 5. Maximum Clique • 6. Covering a graph with cliques • 7. Partitioning into cliques • 8. Any algorithm from Chapter 2 of the Micheli book

  3. In case you selected reading option • Your task is to find on internet or in KAIST library a paper published after 1995 that is related to any of the combinational optimization problems presented in the class and present this paper in a class using PPT or other presentation tool in English. • 1. Set covering (unate covering) • 2. Solving Boolean equations • 3. Solving Petrick Function • 4. Graph Coloring • 5. Maximum Clique • 6. Covering a graph with cliques • 7. Partitioning into cliques • 8. Any algorithm from Chapter 2 of the Micheli book

  4. In case you selected theory option • Your task is to create your own algorithm for some general or specific task related to the material from the class such as combinational optimization problems. • You have todescribe your work in English, but you will be not requested to present it in the class. • Any of the topics above as well as anything from Chapters 1 and 2 of the Micheli’s book. • You can contact me by email or in person about other research issues. They can lead to journal and conference publications. Some of them are easy to explain, like graph coloring, but nobody knows good algorithms for them. I will present some of them also on Friday.