258 citations
- Laboratoire Angevin de Recherche en MathématiquesFR198 papers
- Centre National de la Recherche ScientifiqueFR127 papers
- Institut des Sciences et Technologies Moléculaires d'AngersFR31 papers
- Sorbonne UniversitéFR17 papers
- Wrocław University of Science and TechnologyPL17 papers
- Institut de Mathématiques de ToulouseFR13 papers
- Institute for Theoretical and Experimental PhysicsRU12 papers
- Université Paris-SaclayFR12 papers
- Université Toulouse III - Paul SabatierFR12 papers
- Horia Hulubei National Institute for R and D in Physics and Nuclear EngineeringRO10 papers
- Institut d'électronique de microélectronique et de nanotechnologieFR10 papers
- Université Nantes Angers Le MansFR10 papers
4 papers · 2 filters
Modular Constraint Solver Cooperation via Abstract Interpretation
Pierre Talbot, Éric Monfroy, Charlotte Truchet
Cooperation among constraint solvers is difficult because different solving paradigms have different theoretical foundations. Recent works have shown that abstract interpretation c…
Towards Metric Temporal Answer Set Programming
Pedro Cabalar, Martin Dieguez, Torsten Schaub +1
We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming. In analogy to previous extensions of ASP with constructs from Linear Tempora…
Probability Learning based Tabu Search for the Budgeted Maximum Coverage Problem
Liwen Li, Zequn Wei, Jin-Kao Hao +1
Knapsack problems are classic models that can formulate a wide range of applications. In this work, we deal with the Budgeted Maximum Coverage Problem (BMCP), which is a generalize…
Solving the Clustered Traveling Salesman Problem via TSP methods
Yongliang Lu, Jin-Kao Hao, Qinghua Wu
The Clustered Traveling Salesman Problem (CTSP) is a variant of the popular Traveling Salesman Problem (TSP) arising from a number of real-life applications. In this work, we explo…