-
Institution:
-
George Mason University
-
Subject:
-
-
Description:
-
Credits: 3 Introduces network and combinatorial optimization problems in logistics, computer science, electrical engineering, and systems engineering. Solution techniques for various classes of such problems are developed. Topics include scheduling algorithms, capital budgeting, minimal cost network flow, optimal routings, and generalized networks. Scheduling algorithms, network reliability, stochastic networks, and combinatorially based network problems are discussed. Prerequisites OR 642, 643, or 690. Hours of Lecture or Seminar per week 3 Hours of Lab or Studio per week 0
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(703) 993-1000
-
Regional Accreditation:
-
Southern Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.