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

DOI10.1016/J.COR.2021.105368MaRDI QIDQ2668796zbMATH OpenOpenAlexFDO

Authors Padraig Corcoran, Andrei Gagarin

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

\(k\)-dominationfacility locationheuristic methods

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Experimental analysis of Heuristic algorithms for the dominating set problem
• Approximation algorithms for the k-center problem: an experimental evaluation
• Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
• Analysis of a greedy heuristic for finding small dominating sets in graphs
• A matheuristic approach for solving the 2-connected dominating set problem

Cites work

• \(k\)-domination and \(k\)-independence in graphs: A survey
• Algorithmic aspects of the \(k\)-domination problem in graphs
• Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
• Analysis of a greedy heuristic for finding small dominating sets in graphs
• Experimental analysis of Heuristic algorithms for the dominating set problem
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 4121429 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 6469213 (Why is no real title available?)
• Multiple domination models for placement of electric vehicle charging stations in road networks
• On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
• Randomized algorithms and upper bounds for multiple domination in graphs and networks

Cited in

(7)

• Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
• Exact and heuristic algorithms for the domination problem
• Weighted domination models and randomized heuristics
• Heuristics for the weighted total domination problem
• Minimum-cardinality global defensive alliances in general graphs
• Total domination and open packing in two subclasses of triangle-free graphs
• Approximation algorithms and ratios for multiple domination in graphs

Describes a project that uses

Uses Software

• OpenStreetMap
• NetworkX

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

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