美国数学建模竞赛特等奖论文——2006 B M Minimal Costs for Serving Disabilities【数学建模】.pdfVIP

Introduction 页码，1/25 Team Control Number For office use only For office use only T1 ________________ 162 F1 ________________ ________________ T2 ________________ F2 F3 T3 ________________ ________________ Problem Chosen F4 T4 ________________ ________________ B 2006 Mathematical Contest in Modeling (MCM) Summary Sheet (Attach a copy of this page to each copy of your solution paper.) Type a summary of your results on this page. Do not include the name of your school, advisor, or team members on this page. Summary Although air travel today is available to most people, difficulties to access still exist. A passenger with a disability may encounter inconvenience to change to a different airplane. Because airline provides wheelchairs and escorts to serve disabilities, it will generate costs. This paper is aimed to construct the economical scheduling algorithm about the movement of wheelchairs and escorts throughout a day, and find the minimal budget costs. Firstly, combining the theory of greedy metho