A mixed integer linear programming formulation for restrained Roman domination problem

MaRDI QIDQ4682585zbMATH OpenFDO

Authors Marija Ivanović

Publication date 18 September 2018

zbMATH Keywords

combinatorial optimizationinteger linear programmingrestrained Roman domination in graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Mixed integer programming (90C11)

Recommendations

• Improved mixed integer linear programing formulations for Roman domination problem
• Integer linear programming formulations for double Roman domination problem
• Improved integer linear programming formulation for weak Roman domination problem
• On the \(k\)-strong Roman domination problem
• Complexity aspects of restrained Roman domination in graphs

Cited in

(3)

• scientific article; zbMATH DE number 7509363 (Why is no real title available?)
• Improved mixed integer linear programing formulations for Roman domination problem
• Complexity issues concerning the quadruple Roman domination problem in graphs

This page was built for publication: A mixed integer linear programming formulation for restrained Roman domination problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682585)