arXiv:2606. 18730v1 Announce Type: cross Abstract: The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a minimum cost trajectory for an agent that departs from a static depot, visits a set of moving targets, each within one of their assigned time windows, and returns to the depot.
By Allen George Philip, Anoop Bhat, Sivakumar Rathinam, Howie Choset
arXiv:2607. 13344v1 Announce Type: new Abstract: Constraint Answer Set Programming (CASP) is a hybrid reasoning paradigm that combines Answer Set Programming (ASP) with Constraint Processing and Satisfiability Modulo Theories (SMT), enabling powerful declarative encodings of complex combinatorial search problems.
By Yuliya Lierler
arXiv:2607. 20022v1 Announce Type: new Abstract: Difference constraints of the form $x - y \leq d$ are well studied, with efficient algorithms for satisfaction and implication, because of their connection to shortest paths.
By Lucas Kletzander, Jip J. Dekker, Andreas Schutt, Peter J. Stuckey
arXiv:2608. 11230v1 Announce Type: new Abstract: This paper introduces the edge-based contiguous p-median (ECpM) problem to partition the roads in a network into a given number of compact and contiguous territories.
By Zeyad Kassem, Adolfo R. Escobedo
arXiv:2607. 21197v1 Announce Type: cross Abstract: The growing demand for Urban Air Mobility (UAM) introduces significant challenges in airspace management, particularly within densely populated metropolitan regions.
By Gioacchino Sterlicchio (DMMM, Polytechnic University of Bari, Bari, Italy), Angelo Oddi (ISTC-CNR, Rome, Italy), Riccardo Rasconi (ISTC-CNR, Rome, Italy), Francesca Alessandra Lisi (DIB,CILA, University of Bari Aldo Moro, Bari, Italy)
arXiv:2608. 15143v1 Announce Type: new Abstract: Constraint solving is a declarative approach for solving combinatorial satisfaction and optimization problems.
By Tias Guns, Ignace Bleukx, Hendrik Bierlee, Jo Devriendt, Emilio Gamba, Orestis Lomis, Wout Piessens, Thomas Sergeys, Dimos Tsouros, Wout Vanroose, H\'el\`ene Verhaeghe