42 citations · 144 across the 30 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.OC2020
SDP-based bounds for the Quadratic Cycle Cover Problem via cutting plane augmented Lagrangian methods and reinforcement learning
Frank de Meijer, Renata Sotirov
We study the Quadratic Cycle Cover Problem (QCCP), which aims to find a node-disjoint cycle cover in a directed graph with minimum interaction cost between successive arcs. We deri…
math.OC2020★ 1 cited
The maximum -colorable subgraph problem and related problems
Renata Sotirov, Olga Kuryatnikova, Juan Vera
The maximum -colorable subgraph (MCS) problem is to find an induced -colorable subgraph with maximum cardinality in a given graph. This paper is an in-depth analysis of th…