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

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 260; číslo 1; s. 41 - 55
Hlavní autoři: Colombi, Marco, Mansini, Renata, Savelsbergh, Martin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.07.2017
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•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 Generalized Independent Set Problem, we are given a graph, a revenue for each vertex, and a set of removable edges with associated removal costs, and we seek to find an independent set that maximizes the net benefit, i.e., the difference between the revenues collected for the vertices in the independent set and the costs incurred for any removal of edges with both endpoints in the independent set. We study the polyhedron associated with a 0–1 linear programming formulation of the Generalized Independent Set Problem, deriving a number of facet-inducing inequalities, and we develop linear programming based heuristics to obtain high-quality solutions in a short amount of time. We also develop a heuristic method based on an unconstrained 0–1 quadratic programming formulation of the Generalized Independent Set Problem. In an extensive computational study, we assess the performance of these heuristics in terms of quality and efficiency. The best heuristic is then used to produce an initial solution for a branch-and-cut algorithm which uses some of the proposed facet-inducing inequalities.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2016.11.050