Search Results - "Miyazawa, F.K."

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation by Cintra, G.F., Miyazawa, F.K., Wakabayashi, Y., Xavier, E.C.

“…We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two…”
Get full text

An ultra-fast user-steered image segmentation paradigm: live wire on the fly by Falcao, A.X., Udupa, J.K., Miyazawa, F.K.

“…The authors have been developing general user steered image segmentation strategies for routine use in applications involving a large number of data sets. In…”
Get full text

A note on the approximability of cutting stock problems by Cintra, G.F., Miyazawa, F.K., Wakabayashi, Y., Xavier, E.C.

“…Cutting stock problems and bin packing problems are basically the same problems. They differ essentially on the variability of the input items. In the first,…”
Get full text

Parametric on-line algorithms for packing rectangles and boxes by Miyazawa, F.K., Wakabayashi, Y.

“…We present approximation algorithms for the following problems: the two-dimensional bin packing (2BP), the three-dimensional packing problem (TPP) and the…”
Get full text

The class constrained bin packing problem with applications to video-on-demand by Xavier, E.C., Miyazawa, F.K.

“…In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem…”
Get full text

Three-dimensional packings with rotations by Miyazawa, F.K., Wakabayashi, Y.

“…We present approximation algorithms for the three-dimensional strip packing problem, and the three-dimensional bin packing problem. We consider orthogonal…”
Get full text

A one-dimensional bin packing problem with shelf divisions by Xavier, E.C., Miyazawa, F.K.

“…Given bins of size B, non-negative values d and Δ , and a list L of items, each item e ∈ L with size s e and class c e , we define a shelf as a subset of items…”
Get full text

Two- and three-dimensional parametric packing by Miyazawa, F.K., Wakabayashi, Y.

“…We present approximation algorithms for the two- and three-dimensional bin packing problems and the three-dimensional strip packing problem. We consider the…”
Get full text

Selfish Square Packing by Fernandes, C.G., Ferreira, C.E., Miyazawa, F.K., Wakabayashi, Y.

“…We consider a game-theoretical bin packing problem. The 1D (one dimensional) case has been treated in the literature as the ʼselfish bin packing problemʼ. We…”
Get full text

A one-dimensional bin packing problem with shelf divisions by Xavier, E.C., Miyazawa, F.K.

Get full text

Two- and three-dimensional parametric packing by Miyazawa, F.K., Wakabayashi, Y.

Get full text

Cube packing by Miyazawa, F.K., Wakabayashi, Y.

“…The Cube Packing Problem (CPP) is defined as follows. Find a packing of a given list of (small) cubes into a minimum number of (larger) identical cubes. We…”
Get full text

Approximation schemes for knapsack problems with shelf divisions by Xavier, E.C., Miyazawa, F.K.

“…Given a knapsack of size K , non-negative values d and Δ , and a set S of items, each item e ∈ S with size s e and value v e , we define a shelf as a subset of…”
Get full text

Multidimensional Cube Packing by Kohayakawa, Y., Miyazawa, F.K., Raghavan, P., Wakabayashi, Y.

“…We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity…”
Get full text

Distributed selfish bin packing by Miyazawa, F.K., Vignatti, A.L.

“…We consider a game-theoretic bin packing problem with identical items, and we study the convergence time to a Nash equilibrium. In the model proposed, users…”
Get full text