http://vv.cs.byu.edu/cs312-003/ Algorithm Analysis, MWF 4-450pm, 120 TMCB, Jones M. Copyright 2005 Wed, 13 Apr 2005 14:51:55 -0700 http://www.movabletype.org/?v=3.11 http://blogs.law.harvard.edu/tech/rss Its a two part exam. The first part has 15 fill-in-the-bubble questions. The second part has 5 short essay answer type questions. There are no point values listed on the exam. The first 15 questions are worth 2 points each.... http://vv.cs.byu.edu/cs312-003/archives/2005/04/final_exam_form.html http://vv.cs.byu.edu/cs312-003/archives/2005/04/final_exam_form.html Exams Wed, 13 Apr 2005 14:51:55 -0700 On the final exam, the question that asks you to put a linear programming problem into "basic form" should read "slack form" (Its problem 18)... http://vv.cs.byu.edu/cs312-003/archives/2005/04/important_typo_1.html http://vv.cs.byu.edu/cs312-003/archives/2005/04/important_typo_1.html Exams Wed, 13 Apr 2005 14:47:59 -0700 Here is the problem to solve with your linear programming project. The project is due the last day of classes. There will be no late days. The project is to turn this problem into a linear programming problem and then... http://vv.cs.byu.edu/cs312-003/archives/2005/04/linear_programm.html http://vv.cs.byu.edu/cs312-003/archives/2005/04/linear_programm.html Projects Mon, 04 Apr 2005 10:29:36 -0700 Just a reminder that the due date for the TSP project was moved to today. Be sure to turn something in (not neccesarily today) even if it is incomplete.... http://vv.cs.byu.edu/cs312-003/archives/2005/04/tsp_is_due_toda.html http://vv.cs.byu.edu/cs312-003/archives/2005/04/tsp_is_due_toda.html Projects Mon, 04 Apr 2005 08:41:13 -0700 The notes were updated to include implementation notes on page 10 on 4/4. We have developed a set of notes on linear programming. The notes are complete, although I wouldn't be surprised if they were expanded as we cover them... http://vv.cs.byu.edu/cs312-003/archives/2005/04/notes_on_linear.html http://vv.cs.byu.edu/cs312-003/archives/2005/04/notes_on_linear.html Lectures Mon, 04 Apr 2005 05:23:19 -0700 [a LP flash tutorial, notes on linear programming] The flash tutorial is quite nice, copmlete and slow. The notes are from Sean Warnick. They are also quite good.... http://vv.cs.byu.edu/cs312-003/archives/2005/04/more_resources.html http://vv.cs.byu.edu/cs312-003/archives/2005/04/more_resources.html Lectures Fri, 01 Apr 2005 15:22:13 -0700 The solutions to the TSP premature cycle detection and edge inclusion/exclusion homeworks have been posted.... http://vv.cs.byu.edu/cs312-003/archives/2005/03/solutions_poste.html http://vv.cs.byu.edu/cs312-003/archives/2005/03/solutions_poste.html Homework Thu, 31 Mar 2005 08:53:08 -0700 April 6 Rob and Doyle and Chris Hathaway and April 8 Kawika and Andrew Harris and Ben Booth and Brad... http://vv.cs.byu.edu/cs312-003/archives/2005/03/scheduling_for.html http://vv.cs.byu.edu/cs312-003/archives/2005/03/scheduling_for.html Projects Wed, 30 Mar 2005 15:54:15 -0700 YOu have to write a presentation and describe your favorite improvement. That presentation should go about 10 minutes and you should allow a few minutes for questions. The TAs will use the following form to evaluate your presentation:... http://vv.cs.byu.edu/cs312-003/archives/2005/03/more_about_impr.html http://vv.cs.byu.edu/cs312-003/archives/2005/03/more_about_impr.html Projects Wed, 30 Mar 2005 14:35:50 -0700 What to put in each node? - Reduced matrix - lower bound - included edges - excluded edges How to generate children? - one child for from “here” to every destination o probably not a good idea. Queue gets... http://vv.cs.byu.edu/cs312-003/archives/2005/03/notes_about_tsp.html http://vv.cs.byu.edu/cs312-003/archives/2005/03/notes_about_tsp.html Lectures Wed, 30 Mar 2005 11:50:35 -0700 A kind student has created an access database with more TSP examples Warning: some lines have a preceeding space on their row definition and others do not.... http://vv.cs.byu.edu/cs312-003/archives/2005/03/an_access_datab.html http://vv.cs.byu.edu/cs312-003/archives/2005/03/an_access_datab.html Projects Wed, 30 Mar 2005 10:37:15 -0700 We have created an archive with more tsp problems. They aren't in an access database, you get to do that tedious step yourself. If you do put them in the database you are invited to send that database to me... http://vv.cs.byu.edu/cs312-003/archives/2005/03/more_tsp_proble.html http://vv.cs.byu.edu/cs312-003/archives/2005/03/more_tsp_proble.html Projects Mon, 28 Mar 2005 10:41:16 -0700 We will wrap up the TSP algorithm today. Wednesday (3/30) we will do the minimax algorithm and start linear programing if time permits. Friday (4/1) we will go into linear programing in earnest and stick with that through the last... http://vv.cs.byu.edu/cs312-003/archives/2005/03/the_plan_for_th.html http://vv.cs.byu.edu/cs312-003/archives/2005/03/the_plan_for_th.html Schedule Mon, 28 Mar 2005 08:52:33 -0700 This is the algorithm so far. We will continue fleshing out the details on Monday.... http://vv.cs.byu.edu/cs312-003/archives/2005/03/putting_the_tsp.html http://vv.cs.byu.edu/cs312-003/archives/2005/03/putting_the_tsp.html Lectures Fri, 25 Mar 2005 19:50:52 -0700 Answer the following questions: What is a premature cycle? Are premature cycles possible in the include/exclude formulation of the problem? That's the algorithm that picks an edge to include and exclude resulting in two new nodes. Sketch an algorithm and... http://vv.cs.byu.edu/cs312-003/archives/2005/03/avoiding_premat.html http://vv.cs.byu.edu/cs312-003/archives/2005/03/avoiding_premat.html Homework Fri, 25 Mar 2005 15:45:25 -0700