Variable Objective Search

This paper introduces the variable objective search framework for combinatorial optimization. The method utilizes different objective functions used in alternative mathematical programming formulations of the same combinatorial optimization problem in an attempt to im-prove the solutions obtained using each of these formulations individu-ally. The proposed technique is illustrated using alternative quadratic unconstrained binary formulations of the classical maximum indepen-dent set problem in graphs