Beskjeder

Although rather late, the notes from the last two lectures are now posted, in case you want to have a look.

The exam schedule is now available (see this page). Good luck!

Here is Advice+summary that may be useful when you prepare for the exam.

A change in the syllabus/plan: Wednesday 25. the lecture will consist in summary/examples/comments/questions to the course. NOTE: We remove "Network flows and comb. matrix theory" from the syllabus since it is enough material as it is! (If you are interested in a copy of those notes; just send an email to GD). Finally, on Wednesday 2.Dec. you may also ask questions (usual time/place). The final update on the syllabus + some advice for the exam will be posted later this week. Good luck in the final preparations!

Next week (25.nov.) is last ordinary lecture. Moreover, by the end of that week, we will write a couple of pages concerning the exam (what happens, advice, what are the central concepts/theorems etc/ideas/algorithms).

You may send Project 2 to Carlo M. by email: mannino@dis.uniroma1.it

The data file for Project 2 is now on this page. (There were two identical edges in the first file published; this does not matter, but it has been corrected now.) Good luck!

Project 2 is now posted here; the deadline is Nov. 20. This is a computational project. It concerns the Traveling Salesman Problem and polyhedral methods. The data file is found next to the Project 2 link. If you have questions (e.g. on the modeling language), you may ask Carlo. Good luck!

Here we collect typos in the lecture notes on Combinatorial Optimization: (1) Page 21, Line 9, A = [B N], should be A' = [B N]. (2) Proof of Prop. 2.12, line 4: dimension less than t. (3) Page 29, Line 13, w: E -> R becomes w: E->R+. (4) Page 32, eq. (3.2), replace bar{x} by bar{F}. (5) Page 45, line 8: replace "fathomed" by "pruned".

Now some new exercises (both interesting and useful!!) have been added to the notes "Network flows and comb.matrix theory", see detailed teaching plan. Remember to check your Project 1 (see message below).

The final version of the Combinatorial Optimization notes is now available. If you find typos etc., we would be very grateful if you let us know!

Project 1 has been corrected and the results are registered in the Ifi oblig. system (https://wwws.ifi.uio.no/): please check your result! In general good results; well done! You may collect you paper during next lecture or in GD's office.

Wednesday Sept. 30 there will only be lectures/teaching till 11.00, due to a Master student meeting right after this.

Here we summarize small corrections in Convexity notes. NOTE: an updated version is on the web page. The corrections: (1) Prop.2.3.2(ii) "convex comb." should be "nonnegative comb.", (2) A sentence has been added in the proof of Theorem 3.2.5 "We claim ...". (3) Proof of Theorem 4.4.4: the cone A was renamed, and a typo (y^Tz_j <0) was corrected, and the set C in the last paragraph was rewritten.

Exam (oral) will be December 8. (possibly also Dec. 9. if many students). The second project will be on The Traveling Salesman Problem and the deadline will be November 22. (it will be available about three weeks before).

The lecture notes in Convexity has been (and will be) updated by correcting a minor "typo" occuring many times: matrices were written in lower-case letters! (Some like this, but the author doesn't; it was due a "replace" command accident!) The updated notes are on the web page, but you need not print the newest version.

Compulsory project 1 (on Convexity) is now available; see this page. It should be completed by Sept. 30. It has a theoretical focus. The second (and final) project will be in Comb.Opt., with a more applied focus. Enjoy the projects!

NOTE: The lectures are normally in room B1036. (If, for some reason, we must use B70, we write a message about this.)

The course will focus on three topics: (i) convexity and polyhedral theory, (ii) combinatorial optimization, (iii) combinatorial matrix theory. A main goal is to show that there are close connections between these areas. Three hours teaching each week and you are expected to read some parts of the syllabus on your own. Welcome to the course!