Pages that link to "Item:Q5279216"
From MaRDI portal
The following pages link to Improved mixed integer linear programing formulations for roman domination problem (Q5279216):
Displayed 8 items.
- Roman domination problem with uncertain positioning and deployment costs (Q781325) (← links)
- The Roman domination number of some special classes of graphs - convex polytopes (Q3390794) (← links)
- Algorithmic aspects of total Roman {3}-domination in graphs (Q5025138) (← links)
- Integer linear programming formulations for double roman domination problem (Q5038168) (← links)
- Independent roman $\{3\}$-domination (Q5103952) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- Binary programming formulations for the upper domination problem (Q6080758) (← links)
- Algorithmic results in Roman dominating functions on graphs (Q6161427) (← links)