Cover -- copyright page -- Title page -- Contents -- Introduction -- An Industrial Mathematics Program -- Introduction -- What IS industrial mathematics? -- Who are ``we'' mathematicians? -- What is the Marquette MSCS? -- What constitutes an undergraduate degree? -- What constitutes a graduate degree? -- Do you have an Industrial Mathematics Program? -- What are the components of the Industrial Mathematics Program? -- How did we get here? -- How is Industrial Mathematics related to Biological Mathematics? -- What is a Work Experience Coordinator? -- What classes in industrial mathematics do you offer? -- How are our classes taught? -- War stories? -- Whom are we trying to please? -- Where do our clients come from? -- What to do? LISTEN -- Who does what? -- What kinds of projects? -- What does the client pay? -- What sort of projects do you do? -- How do you attract new students? -- What work experiences are available to your students? -- Do you give credit for co-ops and internships? -- What are the sources of work experiences? -- How do you place students? -- What is the role of consulting by faculty? -- What sort of industrial consulting do you do yourself? -- What are your faculty rewards? -- What resources and funding are required? -- What is your program evaluation? -- How can I do something similar at my place? -- Epilog -- Source of Problems: Industrial Contacts -- Source of Problems: Industrial Contacts -- Panel Discussion Following``Industrial Contacts" -- Course Integration -- The Consortium for Mathematics and Its Applications (COMAP) -- What's COMAP? -- UMAP Modules -- The UMAP Journal -- The Tools for Teaching Volumes -- Projects at the High School Level -- The Mathematical Contest in Modeling -- Judging -- The UMAP Journal Publishes the Outstanding Papers -- Interdisciplinary Lively Application Projects -- For All Practical Purposes.

Other COMAP Endeavors -- The Future -- References -- Program Management -- Towson University NSF Grant -- Faculty Participation and Support -- Sponsor Fees -- Students and Benefits -- Facilities and Equipment -- Outreach and the University -- Solicitation of Projects -- Defining the Problem -- Choosing Faculty Leadership -- Signing on the Dotted Line -- Confidentiality -- Fees -- Choosing Students -- Monitoring Progress and Changing Course -- The Writing Process -- What Works for Us -- Applied Math Lab Projects at Towson University -- Project Deliverables I -- Project Deliverables II -- Legal Agreements -- Inter-disciplinary Teams -- Illustrative Projects -- Using Projects from Industry to Teach Math and Stats to Liberal Arts Majors -- Introduction -- Background and Motivation -- The Credit Union Scheduling Problem -- Reports and Presentations -- The role of class lectures and laboratories -- The types of projects used in our course -- The mathematical topics usually used in the projects -- How to find good projects -- Evaluations -- Summary -- Mathematical Modeling in ICIC Projects -- The First Example: Converting Part-Time Workers to Full-Time Employment -- Statement of Problem -- Strategy -- Implementation -- Results -- A Second Example: Assessing Parking Demand in the Renovated Jazz Districk of Kansas City -- Description of the District -- Statement of the Problem and Strategy Development -- Implementation -- Results -- Acknowledgements -- References -- Appendix: A Sample HMC Report -- Final Report -- Chapter 1 Introduction -- 1.1 What is a Geographic Information System? -- 1.2 Profile of Environmental Systems Research Institute, Inc. -- 1.3 ESRI's software products -- Chapter 2 Project Definition -- 2.1 Shortest Path Problem Definition -- 2.1.1 Mathematical Representation -- 2.2 Why ``short'' path? -- 2.3 Company Profiles -- 2.4 Project Goals.

Chapter 3 Dijkstra's Algorithm -- 3.1 Dijkstra's Algorithm -- 3.2 An illustrative example -- Chapter 4 Level Graph Algorithms -- 4.1 Motivation -- 4.2 LGS: Level Graph Search -- 4.3 ALGS: Augmented Level Graph Search -- Chapter 5 Discussion of Results -- 5.1 Test coverages -- 5.2 Demonstration interface -- 5.3 Heuristics -- 5.4 Test results -- Chapter 6 Solver Code -- 6.1 About the finished code -- 6.1.1 Technical details on layers -- 6.1.2 Compiling and Linking -- 6.2 A word on coverages -- 6.3 Preparation of coverages -- 6.3.1 Preparing level codes -- 6.3.2 Third-party digital maps -- 6.3.3 Exporting the coverage topology files -- 6.4 Stops file -- 6.5 Execution of the solver code -- Chapter 7 Conclusion -- 7.1 Recommendations for future work -- 7.2 Acknowledgements -- Appendix A File Listing -- References.