Flávio Keidi Miyazawa

Orcid: 0000-0002-1067-6421

Affiliations:
  • University of Campinas, Sao Paulo, Brazil


According to our database1, Flávio Keidi Miyazawa authored at least 86 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Preface: LAGOS'21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil.
Discret. Appl. Math., December, 2023

The integrated lot-sizing and cutting stock problem under demand uncertainty.
Int. J. Prod. Res., October, 2023

Tight bounds for the price of anarchy and stability in sequential transportation games.
J. Comb. Optim., September, 2023

Guest Editorial: Special Issue on Theoretical Informatics.
Algorithmica, August, 2023

Improved NP-hardness results for the minimum <i>t</i>-spanner problem on bounded-degree graphs.
Theor. Comput. Sci., February, 2023

Exact solution of network flow models with strong relaxations.
Math. Program., February, 2023

Algorithms for the Bin Packing Problem with Scenarios.
CoRR, 2023

Approximation Schemes Under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

2022
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem.
Discret. Optim., 2022

Minimum t-Spanners on Subcubic Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 2022

Tree 3-Spanners on Generalized Prisms of Graphs.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021
Partitioning a graph into balanced connected classes: Formulations, separation and experiments.
Eur. J. Oper. Res., 2021

Exact solution techniques for two-dimensional cutting and packing.
Eur. J. Oper. Res., 2021

A tight lower bound for the online bounded space hypercube bin packing problem.
Discret. Math. Theor. Comput. Sci., 2021

Recent dynamic vehicle routing problems: A survey.
Comput. Ind. Eng., 2021

New Exact Techniques Applied to a Class of Network Flow Formulations.
Proceedings of the Integer Programming and Combinatorial Optimization, 2021

2020
Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane.
Theor. Comput. Sci., 2020

Smart energy pricing for demand-side management in renewable energy smart grids.
Int. Trans. Oper. Res., 2020

Exact algorithms for class-constrained packing problems.
Comput. Ind. Eng., 2020

Cut and Flow Formulations for the Balanced Connected k-Partition Problem.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

Heuristic Approaches for the Stochastic Multi-depot Vehicle Routing Problem with Pickup and Delivery.
Proceedings of the Recent Advances in Computational Optimization, 2020

Stochastic multi-depot vehicle routing problem with pickup and delivery: an ILS approach.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

2019
Online circle and sphere packing.
Theor. Comput. Sci., 2019

Prices of Anarchy of Selfish 2D Bin Packing Games.
Int. J. Found. Comput. Sci., 2019

Quasilinear Approximation Scheme for Steiner Multi Cycle in the Euclidean plane.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Dijkstra graphs.
Discret. Appl. Math., 2019

Integer Programming Approaches to Balanced Connected k-Partition.
CoRR, 2019

2018
Improved continuous enhancement routing solution for energy-aware data aggregation in wireless sensor networks.
Int. J. Distributed Sens. Networks, 2018

Two-Dimensional Knapsack for Circles.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

A Tight Lower Bound for an Online Hypercube Packing Problem and Bounds for Prices of Anarchy of a Related Game.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Clustering through Continuous Facility Location Problems.
Theor. Comput. Sci., 2017

A PTAS for the Geometric Connected Facility Location Problem.
Theory Comput. Syst., 2017

Approximation algorithms for k-level stochastic facility location problems.
J. Comb. Optim., 2017

Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches.
Comput. Ind. Eng., 2017

2016
Heuristics for a hub location-routing problem.
Networks, 2016

A bounded space algorithm for online circle packing.
Inf. Process. Lett., 2016

A branch-and-cut approach for the vehicle routing problem with loading constraints.
Expert Syst. Appl., 2016

Polynomial-Time Approximation Schemes for Circle and Other Packing Problems.
Algorithmica, 2016

A Continuous Enhancement Routing Solution aware of data aggregation for Wireless Sensor Networks.
Proceedings of the 15th IEEE International Symposium on Network Computing and Applications, 2016

Dynamic cargo stability in loading and transportation of containers.
Proceedings of the IEEE International Conference on Automation Science and Engineering, 2016

2015
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems.
Math. Program., 2015

Biased Random-Key Genetic Algorithms for the Winner Determination Problem in Combinatorial Auctions.
Evol. Comput., 2015

A biased random-key genetic algorithm for wireless backhaul network design.
Appl. Soft Comput., 2015

On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns.
4OR, 2015

2014
Order and static stability into the strip packing problem.
Ann. Oper. Res., 2014

Evolutionary algorithms for overlapping correlation clustering.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Polynomial-Time Approximation Schemes for Circle Packing Problems.
Proceedings of the Algorithms - ESA 2014, 2014

2013
A PTAS for the disk cover problem of geometric objects.
Oper. Res. Lett., 2013

A note on a two dimensional knapsack problem with unloading constraints.
RAIRO Theor. Informatics Appl., 2013

Heuristics for the strip packing problem with unloading constraints.
Comput. Oper. Res., 2013

Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Approaches for the 2D 0-1 knapsack problem with conflict graphs.
Proceedings of the 2013 XXXIX Latin American Computing Conference (CLEI), 2013

2012
Distributed Load Balancing Algorithms for Heterogeneous Players in Asynchronous Networks.
J. Univers. Comput. Sci., 2012

Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape.
Expert Syst. Appl., 2012

Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing.
Comput. Oper. Res., 2012

A Cube-covering Problem.
Ars Comb., 2012

2011
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem.
RAIRO Oper. Res., 2011

Bounds on the Convergence Time of Distributed Selfish Bin Packing.
Int. J. Found. Comput. Sci., 2011

Two Dimensional Knapsack with Unloading Constraints.
Electron. Notes Discret. Math., 2011

Two Dimensional Strip Packing with Unloading Constraints.
Electron. Notes Discret. Math., 2011

Selfish Square Packing.
Electron. Notes Discret. Math., 2011

Squared Metric Facility Location Problem
CoRR, 2011

2009
A note on dual approximation algorithms for class constrained bin packing problems.
RAIRO Theor. Informatics Appl., 2009

Convergence Time to Nash Equilibrium in Selfish Bin Packing.
Electron. Notes Discret. Math., 2009

Three-dimensional packings with rotations.
Comput. Oper. Res., 2009

Distributed selfish bin packing.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008
The class constrained bin packing problem with applications to video-on-demand.
Theor. Comput. Sci., 2008

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation.
Eur. J. Oper. Res., 2008

Self-adjustment of resource allocation for grid applications.
Comput. Networks, 2008

A continuous facility location problem and its application to a clustering problem.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

2007
A note on the approximability of cutting stock problems.
Eur. J. Oper. Res., 2007

A set of schedulers for grid networks.
Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

2006
Approximation schemes for knapsack problems with shelf divisions.
Theor. Comput. Sci., 2006

2005
A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique.
ACM J. Exp. Algorithmics, 2005

A one-dimensional bin packing problem with shelf divisions.
Electron. Notes Discret. Math., 2005

Two- and three-dimensional parametric packing.
Electron. Notes Discret. Math., 2005

2004
A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Packing Problems with Orthogonal Rotations.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

A Genetic Algorithm for Telecommunication Network Design.
Proceedings of the Applications of Evolutionary Computing, 2004

2003
Cube packing.
Theor. Comput. Sci., 2003

Parametric on-line algorithms for packing rectangles and boxes.
Eur. J. Oper. Res., 2003

2001
Multidimensional Cube Packing.
Electron. Notes Discret. Math., 2001

2000
An Ultra-Fast User-Steered Image Segementation Paradigm: Live-Wire-On-The-Fly.
IEEE Trans. Medical Imaging, 2000

1999
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem.
SIAM J. Comput., 1999

Ultrafast user-steered image segmentation paradigm: live-wire-on-the-fly.
Proceedings of the Medical Imaging 1999: Image Processing, 1999

1997
An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis.
Algorithmica, 1997


  Loading...