Login / Signup
An Integer Linear Programming Formulation for the Convex Dominating Set Problems.
Jozef Kratica
Vladimir Filipovic
Dragan Matic
Aleksandar Kartelj
Published in:
CoRR (2019)
Keyphrases
</>
convex relaxation
dominating set
np complete
optimization problems
robust optimization
fractional programming
dynamic programming
graphical models
convex optimization
quadratic programming
quadratic program
facility location problem
convex programming