Variable objective search
- Additional Document Info
- View All
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 improve the solutions obtained using each of these formulations individually. The proposed technique is illustrated using alternative quadratic unconstrained binary formulations of the classical maximum independent set problem in graphs. © 2011 Springer Science+Business Media, LLC.
author list (cited authors)
Butenko, S., Yezerska, O., & Balasundaram, B.