The generalized independent set problem: Polyhedral analysis and solution approaches

•The Generalized Independent Set Problem is studied.•The polyhedron of an integer linear programming formulation is investigated.•Linear programming based heuristics are designed, implemented, and tested.•GRASP-tabu search using a 0–1 quadratic programming formulation is most effective. In the Gener...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 260; no. 1; pp. 41 - 55
Main Authors:	Colombi, Marco, Mansini, Renata, Savelsbergh, Martin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2017
Subjects:	0–1 quadratic programming Combinatorial optimization Facets Generalized independent set GRASP tabu search Generalized independent set Facets Combinatorial optimization 0–1 quadratic programming GRASP tabu search
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!