In our research as supported by NSF grant DMI-0100220 we have focused on solution frameworks for classes of large-scale combinatorial optimization problems that are intractable for conventional approaches (such as the direct application of general purpose branch-and-cut (BC) solvers). In particular, we have developed highly effective approaches for radiation treatment planning and for large-scale industrial supply chain design problems that could not be solved by the best available commercial mixed-integer programming (MIP) systems.
展开▼
机译：在我们的研究中，NSF Grant DMI-0100220的支持，我们专注于解决方案框架，用于常规方法的大规模组合优化问题的类别（例如通用分支和切割（BC）求解器的直接应用）。特别是，我们开发了高效的辐射治疗计划和大型工业供应链设计问题，无法由最佳可用的商业混合整数编程（MIP）系统无法解决。
展开▼
