Heuristics for \(k\)-domination models of facility location problems in street networks

DOI10.1016/j.cor.2021.105368OpenAlexW3162360869MaRDI QIDQ2668796

Andrei Gagarin, Padraig Corcoran

Publication date: 7 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.07885

zbMATH Keywords

facility locationheuristic methods\(k\)-domination

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• NetworkX
• OpenStreetMap

Cites Work

• \(k\)-domination and \(k\)-independence in graphs: A survey
• Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• Analysis of a greedy heuristic for finding small dominating sets in graphs
• Experimental analysis of Heuristic algorithms for the dominating set problem
• Multiple domination models for placement of electric vehicle charging stations in road networks
• Randomized algorithms and upper bounds for multiple domination in graphs and networks
• Algorithmic aspects of the \(k\)-domination problem in graphs
• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Heuristics for \(k\)-domination models of facility location problems in street networks