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 ...

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 ...

The targets of this research are problem-solving mathematical models that can solve mathematically vague problems in the real world by formulating them as mathematical problems. Such mathematical ...

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 ...

A group of researchers at the Massachusetts Institute of Technology have devised a potentially more effective way of helping computers solve some of the toughest optimization problems they face. Their ...

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 ...