Teaching Computational Discrete Optimization at the Undergraduate Level

INFORMS Transactions on Education

Leslie E. Trotter¹  Andreas Alpers¹ 

[1] School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853

关键词: combinatorial optimization;    cutting planes;    branch-and-cut;    traveling salesman problem (TSP);    CONCORDE;   

DOI  :  10.1287/ited.1090.0020

学科分类：社会科学、人文和艺术（综合）

来源: INFORMS

【 摘 要 】

We describe a new course on computational discrete optimization that the authors designed and taught at Cornell University. Conceptually new, this course is targeted toward senior-level undergraduate students and not, as is usually the case, toward advanced graduate students. We discuss how recent availability of high quality free software facilitated this undertaking. We hope the ideas and supporting teaching materials in this paper will find further application. Computational implementation and experimentation is an intriguing and challenging approach that can be used extensively in teaching students important skills for solving real-world discrete optimization problems.

【 授权许可】

CC BY