Improved mixed integer linear programing formulations for Roman domination problem

DOI10.2298/PIM1613051IMaRDI QIDQ5279216zbMATH OpenFDO

Authors Marija Ivanović

Publication date 19 July 2017

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

Full work available at URL https://doi.org/10.2298/PIM1613051I

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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)

Recommendations

• A mixed integer linear programming formulation for restrained Roman domination problem
• Integer linear programming formulations for double Roman domination problem
• Improved integer linear programming formulation for weak Roman domination problem
• An improved binary programming formulation for the secure domination problem
• On the \(k\)-strong Roman domination problem

Cited in

(12)

• Improved integer linear programming formulation for weak Roman domination problem
• The Roman domination number of some special classes of graphs - convex polytopes
• A mixed integer linear programming formulation for restrained Roman domination problem
• Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
• Integer linear programming formulations for double Roman domination problem
• Independent Roman \(\{3\}\)-domination
• Algorithmic complexity of weakly connected Roman domination in graphs
• Binary programming formulations for the upper domination problem
• Algorithmic results in Roman dominating functions on graphs
• The signed (total) Roman domination problem on some classes of planar graphs -- convex polytopes
• Roman domination problem with uncertain positioning and deployment costs
• An improved binary programming formulation for the secure domination problem

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

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