In this paper, we focus on a useful modeling concept that is frequently ignored while formulating discrete optimization problems. Very often, there exists a natural symmetry inherent in the problem ...

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

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