Dr. Hearn give an overview of his program – Optimization and Discrete Mathematics at the AFOSR (Air Force) Spring Review 2012. – Describes the value of the travelling salesman problem and how they can ...

Cheng, R. , Liu, J. , Hao, L. and Wu, D. (2026) On the Application of the Infinitesimal Method to Two Categories of Problems in College Physics. Open Journal of Social Sciences, 14, 378-389. doi: ...

OptiMods provides data-driven APIs for specific optimization problems. “Many people have real-life business problems that can be solved with mathematical optimization, and they don’t even realize it.

where \(\mathsf{G}(\cdot)\) is some convex operator and \(\mathcal{F}\) is as set of feasible input distributions. Examples of such an optimization problem include finding capacity in information ...

Methods for NP-hard discrete optimization problems, including general methods like branch-and-bound and cutting planes, as well as special purpose branch-and-cut methods. Students will be able to ...

The Centre for Operations Research and Decision Sciences (CORDS) is located at Simon Fraser University. With faculty members from Business, Computing Science, Mathematics, SIAT and Statistics, the ...

A. P. Punnen, Discrete Mathematics and Graph Theory, (under preparation, Draft version available, 2024) A. P. Punnen, Introduction to Linear Algebra, (under ...