Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
There is no excerpt for this document.
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more.
Course Hero has millions of course specific materials providing students with the best way to expand
their education.
NAME:MAE 101B Advanced Fluid Mechanics - Spring 2010 Midterm # 2 - May 3, 2010 50 minutes, open book, open notes, calculator allowed, no cell phones. Write your answers directly on the exam. 30 points total + 5 extra credit points (optional). The exam is
Copyright 2010 University of Southern California and its InstructorsCopyright 2010 University of Southern California and its InstructorsCopyright 2010 University of Southern California and its InstructorsCopyright 2010 University of Southern California
15.082 and 6.855JSpring 2003Network OptimizationJ.B. Orlin1WELCOME!x x x x xWelcome to 15.082/6.855J Introduction to Network Optimization Instructor: James B. Orlin (jorlin@mit.edu) TA: Agustin Bompadre (abompadr@mit.edu) Website: sloanspace.mit.ed
15.082 and 6.855J February 6, 2003Data Structures1Overview of this Lecturexx xA very fast overview of some data structures that we will be using this semester lists, sets, stacks, queues, networks, trees a variation on the well known heap data struc
15.082 and 6.855J February 11, 2003Lecture 3. Graph SearchBreadth First Search Depth First Search Topological Sort1OverviewToday: Different ways of searching a graph a generic approach breadth first search depth first search data structures to suppor
15.082 and 6.855J February 13, 2003 Flow Decomposition and Transformations1Flow Decomposition and Transformationsx x x xFlow Decomposition Removing Lower Bounds Removing Upper Bounds Node splitting Arc flows: an arc flow x is a vector x satisfying: Le
15.082 and 6.855J February 20, 2003Dijkstra's Algorithm for the Shortest Path Problem1Wide Range of Shortest Path ProblemsxSources and Destinations We will consider single source problems in this lecture Properties of the costs. We will consider non-
15.082 and 6.855JShortest Paths 2: Application to lot-sizing R-Heaps1Application 19.19. Dynamic Lot Sizing (1)xK periods of demand for a product. The demand is dj in period j. Assume that dj > 0 for j = 1 to K. Cost of producing pj units in period j: