Improved integer linear programming formulation for weak Roman domination problem

DOI10.1007/s00500-017-2706-4zbMath1402.90197OpenAlexW2734345192MaRDI QIDQ1626222

Marija Ivanović

Publication date: 27 November 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-017-2706-4

zbMATH Keywords

combinatorial optimizationinteger linear programmingweak Roman domination in graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Binary programming formulations for the upper domination problem ⋮ Algorithmic complexity of weakly connected Roman domination in graphs

Uses Software

• CPLEX
• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong equality of Roman and weak Roman domination in trees
• Bounds on weak Roman and 2-rainbow domination numbers
• Defending the Roman Empire from multiple attacks
• Defending the Roman Empire---a new strategy
• Relating 2-rainbow domination to Roman domination
• Signed Roman domination in graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Exact Algorithms for Weak Roman Domination
• Some results for Roman domination number on Cardinal product of paths and cycles
• Weak Roman domination in graphs
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Improved integer linear programming formulation for weak Roman domination problem