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

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 260; číslo 1; s. 41 - 55
Hlavní autori:	Colombi, Marco, Mansini, Renata, Savelsbergh, Martin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.07.2017
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!