Note that the higher the dimensionality (parameters number) of the optimization problem, the harder it is, and the slower the optimization process is. A family of problem-independent, gradient-free, ...
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 ...
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 ...
Abstract: The growth of Electric Vehicle Routing Problems (EVRPs) in sustainable logistics mainly results from the ever-widening use of Electric Vehicles (EVs) and from being able to meet ...
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 ...
Abstract: Hash-based collaborative filtering (Hash-CF) approaches recently employ efficient Hamming distance of learned binary representations to accelerate recommendations. Benefiting from its ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results