Abstract: Fast enumeration (FE) is a way of efficiency improvement in explicit enumeration. Since its development in 2013, FE gains much attention in the solution of integer programming problems. An ...

This paper develops an algorithm for pure integer programming problems. It first transforms the integer programming problem to an algebraically equivalent Hermite canonical problem, and then employs ...

Abstract: A new method, based on binary integer programming, to solve the problem of fault section estimation in power systems is developed in this work. This optimization model is formulated based on ...

MATH 308 and MATH 343. MATH 345 is recommended. Model building using integer variables, computer solutions, relaxations and lower bounds, heuristics and upper bounds, branch and bound algorithms, ...