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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 260; H. 1; S. 41 - 55
Hauptverfasser:	Colombi, Marco, Mansini, Renata, Savelsbergh, Martin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.07.2017
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!