Improved integer linear programming formulation for weak Roman domination problem

DOI10.1007/S00500-017-2706-4MaRDI QIDQ1626222zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Integer linear programming formulations for double Roman domination problem
• Improved mixed integer linear programing formulations for Roman domination problem
• Defending the Roman Empire---a new strategy
• Exact algorithms for weak Roman domination
• Weak Roman domination in graphs

Cites work

• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• Bounds on weak Roman and 2-rainbow domination numbers
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Defending the Roman Empire from multiple attacks
• Defending the Roman Empire---a new strategy
• Exact Algorithms for Weak Roman Domination
• Graph-Theoretic Concepts in Computer Science
• Properties of independent Roman domination in graphs
• Relating 2-rainbow domination to Roman domination
• Signed Roman domination in graphs
• Six safe grades on weak Roman domination
• Some results for roman domination number on cardinal product of paths and cycles
• Strong equality of Roman and weak Roman domination in trees
• Weak Roman domination in graphs

Cited in

(7)

• Improved mixed integer linear programing formulations for Roman domination problem
• A mixed integer linear programming formulation for restrained Roman domination problem
• Integer linear programming formulations for double Roman domination problem
• Algorithmic complexity of weakly connected Roman domination in graphs
• Binary programming formulations for the upper domination problem
• Exact algorithms for weak Roman domination
• Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles

Describes a project that uses

Uses Software

• Gurobi
• CPLEX

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

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