Flávio K. Miyazawa

From MaRDI portal
Person:251068

Available identifiers

zbMath Open miyazawa.flavio-keidiDBLPm/FlavioKeidiMiyazawaWikidataQ57000016 ScholiaQ57000016MaRDI QIDQ251068

List of research outcomes





PublicationDate of PublicationType
Algorithms for the bin packing problem with scenarios2024-12-03Paper
Polynomial algorithms for sparse spanners on subcubic graphs2024-10-21Paper
Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes2024-07-19Paper
Smart energy pricing for demand‐side management in renewable energy smart grids2023-11-17Paper
The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids2023-10-10Paper
Tight bounds for the price of anarchy and stability in sequential transportation games2023-09-27Paper
Tree 3-spanners on generalized prisms of graphs2023-07-26Paper
Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem2023-05-24Paper
Exact solution of network flow models with strong relaxations2023-03-14Paper
Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs2023-02-01Paper
An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability2022-12-23Paper
Techniques and results on approximation algorithms for packing circles2022-09-30Paper
The arc-item-load and related formulations for the cumulative vehicle routing problem2022-09-15Paper
Minimum \(t\)-spanners on subcubic graphs2022-07-13Paper
Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane2022-04-27Paper
A tight lower bound for the online bounded space hypercube bin packing problem2022-01-27Paper
New exact techniques applied to a class of network flow formulations2021-12-21Paper
Partitioning a graph into balanced connected classes: formulations, separation and experiments2021-06-07Paper
Exact solution techniques for two-dimensional cutting and packing2021-06-03Paper
Exact solution of network flow models with strong relaxations2021-05-31Paper
Cut and flow formulations for the balanced connected \(k\)-partition problem2021-02-04Paper
Randomized approximation scheme for Steiner multi cycle in the Euclidean plane2020-08-17Paper
Two-dimensional knapsack for circles2020-02-12Paper
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game2020-02-12Paper
Prices of Anarchy of Selfish 2D Bin Packing Games2019-06-21Paper
Online circle and sphere packing2019-05-29Paper
Approximation algorithms for \(k\)-level stochastic facility location problems2017-10-17Paper
A PTAS for the geometric connected facility location problem2017-10-12Paper
Clustering through continuous facility location problems2016-12-05Paper
Heuristics for the strip packing problem with unloading constraints2016-11-14Paper
Polynomial-time approximation schemes for circle and other packing problems2016-10-21Paper
https://portal.mardi4nfdi.de/entity/Q31779282016-07-08Paper
A bounded space algorithm for online circle packing2016-03-01Paper
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems2015-10-19Paper
On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns2015-06-23Paper
Order and static stability into the strip packing problem2015-02-27Paper
Polynomial-Time Approximation Schemes for Circle Packing Problems2014-10-08Paper
A PTAS for the disk cover problem of geometric objects2014-05-15Paper
Two-dimensional strip packing with unloading constraints2014-05-05Paper
A note on a two dimensional knapsack problem with unloading constraints2014-02-24Paper
A cube-covering problem.2013-09-09Paper
Selfish square packing2013-07-23Paper
Two dimensional strip packing with unloading constraints2013-07-23Paper
Two dimensional knapsack with unloading constraints2013-07-23Paper
Convergence time to Nash equilibrium in selfish bin packing2013-07-19Paper
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem2013-04-29Paper
Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing2012-11-15Paper
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems2012-11-02Paper
BOUNDS ON THE CONVERGENCE TIME OF DISTRIBUTED SELFISH BIN PACKING2011-05-10Paper
Three-dimensional packings with rotations2009-05-19Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
A note on dual approximation algorithms for class constrained bin packing problems2009-05-06Paper
Self-adjustment of resource allocation for grid applications2008-06-25Paper
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation2008-06-24Paper
A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique2008-06-20Paper
A one-dimensional bin packing problem with shelf divisions2008-04-16Paper
The class constrained bin packing problem with applications to video-on-demand2008-04-15Paper
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand2007-09-10Paper
A note on the approximability of cutting stock problems2007-08-27Paper
https://portal.mardi4nfdi.de/entity/Q34397012007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34396982007-05-29Paper
Two- and three-dimensional parametric packing2007-04-13Paper
Approximation schemes for knapsack problems with shelf divisions2006-03-24Paper
Multidimensional cube packing2005-02-11Paper
Parametric on-line algorithms for packing rectangles and boxes.2003-08-25Paper
Cube packing.2003-08-17Paper
A brief introduction to approximation algorithms. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 23--27, 2001.2001-11-04Paper
Multidimensional cube packing2001-10-24Paper
https://portal.mardi4nfdi.de/entity/Q45083632000-10-03Paper
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem2000-03-19Paper
An algorithm for the three-dimensional packing problem with asymptotic performance analysis1997-04-22Paper

Research outcomes over time

This page was built for person: Flávio K. Miyazawa