56 citations · 59 across the 7 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.AI2024★ 1 cited
Dominating Set Reconfiguration with Answer Set Programming
Masato Kato, Torsten Schaub, Takehide Soh +2
The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the oth…
cs.AI2024
Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming
Irumi Sugimori, Katsumi Inoue, Hidetomo Nabeshima +4
We propose Large Neighborhood Prioritized Search (LNPS) for solving combinatorial optimization problems in Answer Set Programming (ASP). LNPS is a metaheuristic that starts with an…