{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

01_Introduction - 15.082 and 6.855J Spring 2003 Network...

Info icon This preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
1 15.082 and 6.855J Spring 2003 Network Optimization J.B. Orlin
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
2 WELCOME! Welcome to 15.082/6.855J Introduction to Network Optimization Instructor: James B. Orlin ( [email protected] ) TA: Agustin Bompadre ( [email protected] ) Website: sloanspace.mit.edu Register at SloanSpace and log in as soon as possible. Textbook: Network Flows: Theory, Algorithms, and Applications by Ahuja, Magnanti, and Orlin referred to as AMO
Image of page 2
3 Quick Overview Next: The Koenigsberg Bridge Problem Introduces Networks and Network Algorithms Some subject management issues Network Flows and Applications Computational Complexity Overall goal of today’s lecture: set the tone for the rest of the subject provide background provide motivation handle some class logistics
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
4 On the background of students Requirement for this class Either Linear Programming (15.081J) or Data Structures How many have had linear programming? There will be a “review” lecture later in the term How many have had a subject in data structures? The “review” lecture for data structures is Thursday
Image of page 4
5 Some aspects of the class Fondness for Powerpoint animations Cold-calling as a way to speed up learning of the algorithms Talking with partners (the person next to you in in the classroom.) Class time: used for presenting theory, algorithms, applications, theory mostly outlines of proofs illustrated by examples (not detailed proofs) detailed proofs are in the text
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
6 The Bridges of Koenigsberg: Euler 1736 “Graph Theory” began in 1736 Leonard Eüler Visited Koenigsberg People wondered whether it is possible to take a walk, end up where you started from, and cross each bridge in Koenigsberg exactly once Generally it was believed to be impossible
Image of page 6
7 The Bridges of Koenigsberg: Euler 1736 A D C B 1 2 4 3 7 6 5 Is it possible to start in A, cross over each bridge exactly once, and end up back in A?
Image of page 7

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
8 The Bridges of Koenigsberg: Euler 1736 A D C B 1 2 4 3 7 6 5 Conceptualization: Land masses are “nodes”.
Image of page 8
9 The Bridges of Koenigsberg: Euler 1736 1 2 4 3 7 6 5 Conceptualization: Bridges are “arcs.” A C D B
Image of page 9

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
10 The Bridges of Koenigsberg: Euler 1736 1 2 4 3 7 6 5 Is there a “walk” starting at A and ending at A and passing through each arc exactly once? A C D B
Image of page 10
11 Notation and Terminology Network terminology as used in AMO. Node set N = {1, 2, 3, 4} Network G = (N, A) Arc Set A = {(1,2), (1,3), (3,2), (3,4), (2,4)} 2 3 4 1 a b c d e An Undirected Graph or Undirected Network 2 3 4 1 a b c d e A Directed Graph or Directed Network In an undirected graph, (i,j) = (j,i)
Image of page 11

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Directed Path . Example: 1, 2, 5, 3, 4 (or 1, a, 2, c, 5, d, 3, e, 4) No node is repeated. Directions are important. Cycle (or circuit or loop) 1, 2, 3, 1. (or 1, a, 2, b, 3, e) A path with 2 or more nodes, except that the first node is the last node.
Image of page 12
Image of page 13
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern