Improved mixed integer linear programing formulations for roman domination problem

DOI10.2298/PIM1613051IzbMath1461.65158MaRDI QIDQ5279216

Marija Ivanović

Publication date: 19 July 2017

Published in: Publications de l'Institut Math?matique (Belgrade) (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationmixed integer linear programmingRoman domination in graphs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (8)

Integer linear programming formulations for double roman domination problem ⋮ Binary programming formulations for the upper domination problem ⋮ Algorithmic results in Roman dominating functions on graphs ⋮ Independent roman $\{3\}$-domination ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ Roman domination problem with uncertain positioning and deployment costs ⋮ Algorithmic complexity of weakly connected Roman domination in graphs ⋮ Algorithmic aspects of total Roman {3}-domination in graphs

This page was built for publication: Improved mixed integer linear programing formulations for roman domination problem