|
|||||
|
|
Variable objective search |
|
| Authors: | Sergiy Butenko Oleksandra Yezerska Balabhaskar Balasundaram |
| Institution: | 1. Industrial and Systems Engineering, Texas A&M University, College Station, TX, 77843-3131, USA 2. Industrial Engineering & Management, Oklahoma State University, Stillwater, OK, 74078, USA |
| Abstract: | 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |