We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...
Kiyan Ahmadizadeh, Bistra N. Dilkina, Carla P. Gom...
We present two heuristics based on constraint technology that solve the problem of generating air traffic management contingency plans, which are used in the case of a catastrophic...
Karl Sundequist Blomdahl, Pierre Flener, Justin Pe...
Although static ranked lists remain the dominant Web search interface, they can limit the ability of Web searchers to find desired information when it is buried deep in the collect...
This work proposes a biologically inspired system for the coordination of multiple and possible conflicting behaviours in an autonomous mobile robot, devoted to explore novel scena...