135 citations · 141 across the 14 of their papers we have counts for
14 papers
Improved Upper Bounds for Dynamic Bin Packing of General, Unit-Fraction, and Power-Fraction Squares
Miguel A. Mini, Flávio K. Miyazawa, Gabriel M. Silva +1
This paper presents significant upper-bound improvements for dynamic 2D square bin packing, where square items arrive and depart over time and the objective is to minimize the peak…
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…
A tight lower bound for the online bounded space hypercube bin packing problem
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
In the -dimensional hypercube bin packing problem, a given list of -dimensional hypercubes must be packed into the smallest number of hypercube bins. Epstein and van Stee [SI…
Exact solution of network flow models with strong relaxations
Vinícius L. de Lima, Manuel Iori, Flávio K. Miyazawa
We address the solution of Mixed Integer Linear Programming (MILP) models with strong relaxations that are derived from Dantzig-Wolfe decompositions and allow a pseudo-polynomial p…
Tight Bounds for the Price of Anarchy and Stability in Sequential Transportation Games
Francisco J. M. da Silva, Flávio K. Miyazawa, Ieremies V. F. Romero +1
In this paper, we analyze a transportation game first introduced by Fotakis, Gourvès, and Monnot in 2017, where players want to be transported to a common destination as quickly as…
Exact Solution Techniques for Two-dimensional Cutting and Packing
Manuel Iori, Vinícius L. de Lima, Silvano Martello +2
We survey the main formulations and solution methods for two-dimensional orthogonal cutting and packing problems, where both items and bins are rectangles. We focus on exact method…
Integer Programming Approaches to Balanced Connected -Partition
Flávio K. Miyazawa, Phablo F. S. Moura, Matheus J. Ota +1
We address the problem of partitioning a vertex-weighted connected graph into connected subgraphs that have similar weights, for a fixed integer . This problem, known…
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
Y. Kohayakawa, F. K. Miyazawa, Y. Wakabayashi
We prove a tight lower bound on the asymptotic performance ratio of the bounded space online -hypercube bin packing problem, solving an open question raised in 2005. In the…
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…
Prices of anarchy of selfish 2D bin packing games
Cristina G. Fernandes, Carlos E. Ferreira, Flávio K. Miyazawa +1
We consider a game-theoretical problem called selfish 2-dimensional bin packing game, a generalization of the 1-dimensional case already treated in the literature. In this game, th…
Dijkstra Graphs
Lucila M. S. Bento, Davidson R. Boccardo, Raphael C. S. Machado +3
We revisit a concept that has been central in some early stages of computer science, that of structured programming: a set of rules that an algorithm must follow in order to acquir…
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…
A Systematic Approach to Bound Factor-Revealing LPs and its Application to the Metric and Squared Metric Facility Location Problems
Cristina G. Fernandes, Luís A. A. Meira, Flávio K. Miyazawa +1
A systematic technique to bound factor-revealing linear programs is presented. We show how to derive a family of upper bound factor-revealing programs (UPFRP), and show that each s…