Simple and fast surrogate constraint heuristics for the maximum independent set problem

Authors:
Bahram Alidaee;Gary Kochenberger;Haibo Wang
Affiliations:
School of Business, University of Mississippi, Oxford, USA;School of Business, University of Colorado at Denver, Denver, USA;College of Business Administration, Texas A&M International University, Laredo, USA
Venue:
Journal of Heuristics
Year:
2008

Citing 2
Cited 0

Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Computing
Tutorial on Surrogate Constraint Approaches for Optimization in Graphs

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recent paper Glover (J. Heuristics 9:175---227, 2003) discussed a variety of surrogate constraint-based heuristics for solving optimization problems in graphs. The key ideas put forth in the paper were illustrated by giving specializations designed for certain covering and coloring problems. In particular, a family of methods designed for the maximum cardinality independent set problem was presented. In this paper we report on the efficiency and effectiveness of these methods based on considerable computational testing carried out on test problems from the literature as well as some new test problems.