5 citations · 23 across the 13 of their papers we have counts for
5 papers · 1 filter
A faster heuristic for the Traveling Salesman Problem with Drone
Pedro H. D. B. Hokama, Carla N. Lintzmayer, Mário C. San Felice
Given a set of customers, the Flying Sidekick Traveling Salesman Problem (FSTSP) consists of using one truck and one drone to perform deliveries to them. The drone is limited to de…
Approximations for the Steiner Multicycle Problem
Cristina G. Fernandes, Carla N. Lintzmayer, Phablo F. S. Moura
The Steiner Multicycle problem consists of, given a complete graph, a weight function on its vertices, and a collection of pairwise disjoint non-unitary sets called terminal sets,…
How heavy independent sets help to find arborescences with many leaves in DAGs
Cristina G. Fernandes, Carla N. Lintzmayer
Trees with many leaves have applications on broadcasting, which is a method in networks for transferring a message to all recipients simultaneously. Internal nodes of a broadcastin…
Leafy Spanning Arborescences in DAGs
Cristina G. Fernandes, Carla N. Lintzmayer
Broadcasting in a computer network is a method of transferring a message to all recipients simultaneously. It is common in this situation to use a tree with many leaves to perform…
Online Circle and Sphere Packing
Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier
In this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes. The two first ones recei…