Pages that link to "Item:Q2279352"
From MaRDI portal
The following pages link to Integer linear programming models for the weighted total domination problem (Q2279352):
Displaying 9 items.
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
- An integer programming approach for solving a generalized version of the Grundy domination number (Q2032968) (← links)
- Algorithm and hardness results on neighborhood total domination in graphs (Q2201995) (← links)
- Note on the perfect Roman domination number of graphs (Q2284084) (← links)
- A comparison of integer programming models for the partial directed weighted improper coloring problem (Q2414468) (← links)
- Linear programming formulation for some generalized domination parameters (Q5013502) (← links)
- On upper bounds for total k-domination number via the probabilistic method (Q6137153) (← links)
- A knowledge-based iterated local search for the weighted total domination problem (Q6500414) (← links)