The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general ...

The first algorithm is based on an objective space cut and bound method for solving convex FP problems and the second algorithm is based on the proposed bi-objective algorithm for solving nonlinear FP ...