7 citations · 12 across the 12 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.OC2022
The role of rationality in integer-programming relaxations
Manuel Aprile, Gennadiy Averkov, Marco Di Summa +1
For a finite set that can be represented as for some polyhedron , we call a relaxation of and define the relaxation co…
cs.DS2022
Exact approaches for the Connected Vertex Cover problem
Manuel Aprile
Given a graph , the Connected Vertex Cover problem (CVC) asks to find a minimum cardinality vertex cover of that induces a connected subgraph. In this paper we describe some…