Flávio Keidi Miyazawa
Orcid: 0000-0002-1067-6421Affiliations:
- University of Campinas, Sao Paulo, Brazil
According to our database1,
Flávio Keidi Miyazawa
authored at least 89 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
J. Comb. Optim., November, 2024
J. Comb. Optim., August, 2024
A Framework for Approximation Schemes on Knapsack and Packing Problems of Hyperspheres and Fat Objects.
CoRR, 2024
Comput. Oper. Res., 2024
2023
Preface: LAGOS'21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil.
Discret. Appl. Math., December, 2023
Int. J. Prod. Res., October, 2023
Tight bounds for the price of anarchy and stability in sequential transportation games.
J. Comb. Optim., September, 2023
Algorithmica, August, 2023
Improved NP-hardness results for the minimum <i>t</i>-spanner problem on bounded-degree graphs.
Theor. Comput. Sci., February, 2023
Math. Program., February, 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
Proceedings of the WALCOM: Algorithms and Computation, 2022
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
Eur. J. Oper. Res., 2021
Discret. Math. Theor. Comput. Sci., 2021
Proceedings of the Integer Programming and Combinatorial Optimization, 2021
2020
Theor. Comput. Sci., 2020
Int. Trans. Oper. Res., 2020
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
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
2018
Improved continuous enhancement routing solution for energy-aware data aggregation in wireless sensor networks.
Int. J. Distributed Sens. Networks, 2018
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
Theory Comput. Syst., 2017
J. Comb. Optim., 2017
Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches.
Comput. Ind. Eng., 2017
2016
Expert Syst. Appl., 2016
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
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
Appl. Soft Comput., 2015
On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns.
4OR, 2015
2014
Proceedings of the Genetic and Evolutionary Computation Conference, 2014
Proceedings of the Algorithms - ESA 2014, 2014
2013
RAIRO Theor. Informatics Appl., 2013
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
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
RAIRO Oper. Res., 2011
Int. J. Found. Comput. Sci., 2011
Electron. Notes Discret. Math., 2011
2009
RAIRO Theor. Informatics Appl., 2009
Electron. Notes Discret. Math., 2009
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009
2008
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
Discret. Appl. Math., 2008
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008
2007
Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007
2006
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
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
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Proceedings of the Applications of Evolutionary Computing, 2004
2003
Eur. J. Oper. Res., 2003
2000
IEEE Trans. Medical Imaging, 2000
1999
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem.
SIAM J. Comput., 1999
Proceedings of the Medical Imaging 1999: Image Processing, 1999
1997
An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis.
Algorithmica, 1997