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 ...

Dinkelbach's algorithm [2] solving the parametric equivalent of a fractional program is investigated. It is shown that the algorithm converges superlinearly and often (locally) quadratically.

Artificial intelligence, which may at some point automate your job and can already defeat professionals in six-player poker, is now able to solve Rubik's Cube faster than any human.