摘要：The paper proposes a hybrid heuristic algorithm, which uses procedures for search of feasible integer directions with one or two nonzero components and linear optimization. This algorithm is iterative and it combines constructive and locally improving strategies for finding a new current solution. A subsequence of sub-problems is solved, aimed at seeking a feasible solution of the general Mixed Integer Problem (MIP), after which the feasible solution found is improved with respect to the problem objective function. The algorithm is characterized by polynomial-time computing complexity.
