4 papers
Algorithms for the Bin Packing Problem with Scenarios
Yulle G. F. Borges, Vinícius L. de Lima, Flávio K. Miyazawa +3
This paper presents theoretical and practical results for the bin packing problem with scenarios, a generalization of the classical bin packing problem which considers the presence…
Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem
Yulle G. F. Borges, Rafael C. S. Schouery, Flávio K. Miyazawa
This paper focuses on exact approaches for the Colored Bin Packing Problem (CBPP), a generalization of the classical one-dimensional Bin Packing Problem in which each item has, in…
On the approximability and energy-flow modeling of the electric vehicle sharing problem
Welverton R. Silva, Fábio L. Usberti, Rafael C. S. Schouery
The electric vehicle sharing problem (EVSP) arises from the planning and operation of one-way electric car-sharing systems. It aims to maximize the total rental time of a fleet of…
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery +2
We give an asymptotic approximation scheme (APTAS) for the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augme…