http://vv.cs.byu.edu/cs312-003/ Algorithm Analysis, MWF 4-450pm, 120 TMCB, Jones M. 2005-04-13T14:51:55-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/04/final_exam_form.html 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.... Exams jones 2005-04-13T14:51:55-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/04/important_typo_1.html 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)... Exams jones 2005-04-13T14:47:59-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/04/linear_programm.html 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... Projects jones 2005-04-04T10:29:36-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/04/tsp_is_due_toda.html 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.... Projects jones 2005-04-04T08:41:13-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/04/notes_on_linear.html 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... Lectures jones 2005-04-04T05:23:19-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/04/more_resources.html [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.... Lectures jones 2005-04-01T15:22:13-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/03/solutions_poste.html The solutions to the TSP premature cycle detection and edge inclusion/exclusion homeworks have been posted.... Homework jones 2005-03-31T08:53:08-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/03/scheduling_for.html April 6 Rob and Doyle and Chris Hathaway and April 8 Kawika and Andrew Harris and Ben Booth and Brad... Projects jones 2005-03-30T15:54:15-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/03/more_about_impr.html 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:... Projects jones 2005-03-30T14:35:50-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/03/notes_about_tsp.html 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... Lectures jones 2005-03-30T11:50:35-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/03/an_access_datab.html 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.... Projects jones 2005-03-30T10:37:15-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/03/more_tsp_proble.html 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... Projects jones 2005-03-28T10:41:16-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/03/the_plan_for_th.html 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... Schedule jones 2005-03-28T08:52:33-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/03/putting_the_tsp.html This is the algorithm so far. We will continue fleshing out the details on Monday.... Lectures jones 2005-03-25T19:50:52-07:00 http://vv.cs.byu.edu/cs312-003/archives/2005/03/avoiding_premat.html 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... Homework jones 2005-03-25T15:45:25-07:00