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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback