135 citations · 267 across the 17 of their papers we have counts for
6 papers · 1 filter
Optimizing the nozzle path in the 3D Printing Process
Manuel Iori, Stefano Novellani
In this paper, we define the 3D printing routing problem, the problem of finding the optimal path of the nozzle in a fused deposition modeling 3D printing system, so as to minimize…
A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem
Jean-François Côté, Mohamed Haouari, Manuel Iori
The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel t…
Branch-and-cut and iterated local search for the weighted -traveling repairman problem: an application to the maintenance of speed cameras
Albert Einstein Fernandes Muritiba, Tibérius O. Bonates, Stênio Oliveira Da Silva +1
Private enterprises and governments around the world use speed cameras to control traffic flow and limit speed excess. Cameras may be exposed to difficult weather conditions and ty…
Solution of minimum spanning forest problems with reliability constraints
Ida Kalateh Ahani, Majid Salari, Seyed Mahmoud Hosseini +1
We propose the reliability constrained k-rooted minimum spanning forest, a relevant optimization problem whose aim is to find a k-rooted minimum cost forest that connects given cus…
The double traveling salesman problem with partial last-in-first-out loading constraints
Jonatas B. C. Chagas, Túlio A. M. Toffolo, Marcone J. F. Souza +1
In this paper, we introduce the Double Traveling Salesman Problem with Partial Last-In-First-Out Loading Constraints (DTSPPL). It is a pickup-and-delivery single-vehicle routing pr…
A Branch-and-Price Algorithm for the Temporal Bin Packing Problem
Mauro Dell'Amico, Fabio Furini, Manuel Iori
We study an extension of the classical Bin Packing Problem, where each item consumes the bin capacity during a given time window that depends on the item itself. The problem asks f…