Flávio Keidi Miyazawa

According to our database1, Flávio Keidi Miyazawa
  • authored at least 69 papers between 1997 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game.
CoRR, 2017

Online Circle and Sphere Packing.
CoRR, 2017

Prices of anarchy of selfish 2D bin packing games.
CoRR, 2017

Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches.
Computers & Industrial Engineering, 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.
Evolutionary Computation, 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
Two-dimensional strip packing with unloading constraints.
Discrete Applied Mathematics, 2014

Polynomial-Time Approximation Schemes for Circle and Other Packing Problems.
CoRR, 2014

Order and static stability into the strip packing problem.
Annals OR, 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. Inf. and Applic., 2013

Heuristics for the strip packing problem with unloading constraints.
Computers & OR, 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. UCS, 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.
Computers & OR, 2012

A Cube-covering Problem.
Ars Comb., 2012

A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem.
RAIRO - Operations Research, 2011

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

Two Dimensional Knapsack with Unloading Constraints.
Electronic Notes in Discrete Mathematics, 2011

Two Dimensional Strip Packing with Unloading Constraints.
Electronic Notes in Discrete Mathematics, 2011

Selfish Square Packing.
Electronic Notes in Discrete Mathematics, 2011

Squared Metric Facility Location Problem
CoRR, 2011

2009
A note on dual approximation algorithms for class constrained bin packing problems.
ITA, 2009

Convergence Time to Nash Equilibrium in Selfish Bin Packing.
Electronic Notes in Discrete Mathematics, 2009

Three-dimensional packings with rotations.
Computers & OR, 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.
European Journal of Operational Research, 2008

A one-dimensional bin packing problem with shelf divisions.
Discrete Applied Mathematics, 2008

Self-adjustment of resource allocation for grid applications.
Computer 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.
European Journal of Operational Research, 2007

Two- and three-dimensional parametric packing.
Computers & OR, 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

The Class Constrained Bin Packing Problem with Applications to Video-on-Demand.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

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

A one-dimensional bin packing problem with shelf divisions.
Electronic Notes in Discrete Mathematics, 2005

Two- and three-dimensional parametric packing.
Electronic Notes in Discrete Mathematics, 2005

2004
Multidimensional Cube Packing.
Algorithmica, 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.
European Journal of Operational Research, 2003

2001
Multidimensional Cube Packing.
Electronic Notes in Discrete Mathematics, 2001

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

Cube Packing.
Proceedings of the LATIN 2000: Theoretical Informatics, 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...