Title
The generalized independent set problem: Polyhedral analysis and solution approaches.
Abstract
•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.
Year
DOI
Venue
2017
10.1016/j.ejor.2016.11.050
European Journal of Operational Research
Keywords
Field
DocType
Combinatorial optimization,Generalized independent set,Facets,0–1 quadratic programming,GRASP tabu search
Heuristic,Mathematical optimization,Active set method,Combinatorial optimization,Independent set,Linear programming,Solution set,Quadratic programming,Mathematics,Maximal independent set
Journal
Volume
Issue
ISSN
260
1
0377-2217
Citations 
PageRank 
References 
3
0.44
12
Authors
3
Name
Order
Citations
PageRank
Marco Colombi1121.89
Renata Mansini257443.10
Martin Savelsbergh32624190.83