|
|
|
|
|
Daniela Ambrosino, Carmine Cerrone and Anna Sciomachen
This paper presents a new heuristic algorithm tailored to solve large instances of an NP-hard variant of the shortest path problem, denoted the cost-balanced path problem, recently proposed in the literature. The problem consists in finding the origin?de...
ver más
|
|
|
|
|
|
|
|
|
|
|
Barry Fagin
Previous work established the set of square-free integers n with at least one factorization ??=??¯??¯
n
=
p
¯
q
¯
for which ??¯
p
¯
and ??¯
q
¯
are valid RSA keys, whether they are prime or composite. These integers are exactly those with the property...
ver más
|
|
|
|
|
|
|
|
|
|
|
Umberto Junior Mele, Luca Maria Gambardella and Roberto Montemanni
Recent systems applying Machine Learning (ML) to solve the Traveling Salesman Problem (TSP) exhibit issues when they try to scale up to real case scenarios with several hundred vertices. The use of Candidate Lists (CLs) has been brought up to cope with t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Víctor Pacheco-Valencia, José Alberto Hernández, José María Sigarreta and Nodari Vakhania
The Traveling Salesman Problem (TSP) aims at finding the shortest trip for a salesman, who has to visit each of the locations from a given set exactly once, starting and ending at the same location. Here, we consider the Euclidean version of the problem,...
ver más
|
|
|
|
|
|
|
|
|
|
|
Angel Alejandro Juan, Canan Gunes Corlu, Rafael David Tordecilla, Rocio de la Torre and Albert Ferrer
Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ma...
ver más
|
|
|
|
|
|
|
|
|
|
A novel high-voltage powerline inspection system was investigated, which consists of the cooperated ground vehicle and drone. The ground vehicle acts as a mobile platform that can launch and recycle the drone, while the drone can fly over the powerline f...
ver más
|
|
|
|
|
|
|
|
|
|
|
Felipe Tomás Muñoz Valdés, Reinaldo Javier Moraga Suazo
Este artículo presenta una heurística constructiva visionaria para resolver el problema de máquinas paralelas no relacionadas con tiempos de setup dependientes de la secuencia, donde el objetivo es minimizar el tiempo de completación del último trabajo, ...
ver más
|
|
|
|
|
|