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
arXiv:2601. 09097v3 Announce Type: replace Abstract: Multi-constraint planning involves identifying, evaluating, and refining candidate plans while satisfying multiple, potentially conflicting constraints.
By Derrick Goh Xin Deik, Quanyu Long, Zhengyuan Liu, Nancy F. Chen, Wenya Wang
arXiv:2606. 29725v1 Announce Type: new Abstract: In this paper, we formulate a new vehicle dispatch optimization problem, called Nursing Care Taxi Dispatch, as a variant of the Vehicle Routing Problem, considering constraints related to wheelchair use, user compatibility, pick-up and drop-off times, and vehicle limitations.
By Riku Nakao, Akihito Hiromori, Hamada Rizk, Hirozumi Yamaguchi
arXiv:2607. 15562v1 Announce Type: cross Abstract: Packing for air travel is recurring and error-prone: the checklist must be personal and context-aware, yet feasible under safety rules, item dependencies, and luggage limits.
By Himel Dev, Madhusudan Basak, Tanmoy Sen, Paromita Shome, Bashima Islam
arXiv:2606. 04816v1 Announce Type: new Abstract: Large language models (LLMs) increasingly translate natural-language optimization problems into executable solver code.
By Xizi Luo, Changhong He, Dongdong Geng, Chenggong Shi, Yu Mei
arXiv:2607. 28679v1 Announce Type: new Abstract: Multi-agent planning problems arise in a variety of engineering applications, such as multi-robot wildfire fighting and unmanned aerial inspection in factories.
By Sheryl Paul, Vidisha Kudalkar, Anand Balakrishnan, Lars Lindemann, Alberto Speranzon, Jyotirmoy V. Deshmukh
arXiv:2608. 14140v1 Announce Type: new Abstract: The problem of route optimization with realistic constraints is becoming extremely relevant in the face of global urban population growth.
By Andrew Soroka, German Mikhelson, Alexander Mescheryakov, Sergey Gerasimov