Advanced search
Start date
Betweenand

Flávio Keidi Miyazawa

CV Lattes GoogleMyCitations ResearcherID ORCID


Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC)  (Institutional affiliation for the last research proposal)
Birthplace: Brazil

bachelor's at Ciência da Computação from Universidade Federal de Mato Grosso do Sul (1990), master's at Mathematics from Universidade de São Paulo (1993) and doctorate at Mathematics from Universidade de São Paulo (1997). Has experience in Computer Science, focusing on Analysis of Algorithms and Computational Complexity, acting on the following subjects: problemas de corte e empacotamento, algoritmos de aproximação, otimização combinatória, problemas de escalonamento de tarefas and teoria dos jogos. (Source: Lattes Curriculum)

Research grants
Scholarships in Brazil
Scholarships abroad
FAPESP support in numbers * Updated October 12, 2019
Total / Available in English
Most frequent collaborators in research granted by FAPESP
Contact researcher

Use this Research Supported by FAPESP (BV/FAPESP) channel only to send messages referring to FAPESP-funded scientific projects.


 

 

 

 

Keywords used by the researcher
Scientific publications resulting from Research Grants and Scholarships under the grantee's responsibility (33)

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

Publications32
Citations54
Cit./Article1.7
Data from Web of Science

XAVIER, EDUARDO C.; MIYAZAWA, FLAVIO KEIDI. A NOTE ON DUAL APPROXIMATION ALGORITHMS FOR CLASS CONSTRAINED BIN PACKING PROBLEMS. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, v. 43, n. 2, p. 239-248, . Web of Science Citations: 1. (08/01490-3)

ANDRADE, CARLOS E.; RESENDE, MAURICIO G. C.; ZHANG, WEIYI; SINHA, RAKESH K.; REICHMANN, KENNETH C.; DOVERSPIKE, ROBERT D.; MIYAZAWA, FLAVIO K.. A biased random-key genetic algorithm for wireless backhaul network design. APPLIED SOFT COMPUTING, v. 33, p. 150-169, . Web of Science Citations: 8. (10/05233-5, 12/08222-0)

DE QUEIROZ, THIAGO ALVES; MIYAZAWA, FLAVIO KEIDI; WAKABAYASHI, YOSHIKO. On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, v. 13, n. 2, p. 199-219, . Web of Science Citations: 1. (13/03447-6, 13/08278-8)

OLIVEIRA, ANDRE R.; FERTIN, GUILLAUME; DIAS, ULISSES; DIAS, ZANONI. Sorting signed circular permutations by super short operations. Algorithms for Molecular Biology, v. 13, . Web of Science Citations: 0. (13/08293-7, 15/11937-9)

BENEDITO, MARCELO P. L.; PEDROSA, LEHILTON L. C.. Approximation algorithms for Median Hub Location Problems. JOURNAL OF COMBINATORIAL OPTIMIZATION, v. 38, n. 2, p. 375-401, . Web of Science Citations: 0. (16/12006-1, 15/11937-9)

LINTZMAYER, CARLA NEGRI; MIYAZAWA, FLAVIO KEIDI; XAVIER, EDUARDO CANDIDO. Online circle and sphere packing. THEORETICAL COMPUTER SCIENCE, v. 776, p. 75-94, . Web of Science Citations: 0. (16/23552-7, 16/14132-4, 15/11937-9, 16/01860-1)

SAMBINELLI, MAYCON; LINTZMAYER, CARLA NEGRI; DA SILVA, CANDIDA NUNES; LEE, ORLANDO. Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for Locally In-Semicomplete Digraphs. GRAPHS AND COMBINATORICS, v. 35, n. 4, p. 921-931, . Web of Science Citations: 0. (16/14132-4, 15/11937-9)

FERNANDES, CRISTINA G.; FERREIRA, CARLOS E.; MIYAZAWA, FLAVIO K.; WAKABAYASHI, YOSHIKO. Prices of Anarchy of Selfish 2D Bin Packing Games. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, v. 30, n. 3, p. 355-374, . Web of Science Citations: 0. (13/03447-6, 16/23552-7, 16/01860-1, 15/11937-9)

C.H. SAMORA; F.L. USBERTI; C. LYRA. Relaxação Lagrangeana Aplicada ao Problema de Cobertura por Hubs. TEMA (São Carlos), v. 19, n. 3, p. -, . (15/11937-9)

SILVA, ANDRE C.; ARROYO, ALAN; RICHTER, R. BRUCE; LEE, ORLANDO. Graphs with at most one crossing. DISCRETE MATHEMATICS, v. 342, n. 11, p. 3201-3207, . Web of Science Citations: 0. (15/04385-0, 14/14375-9, 15/11937-9)

HOKAMA, PEDRO; MIYAZAWA, FLAVIO K.; XAVIER, EDUARDO C.. A branch-and-cut approach for the vehicle routing problem with loading constraints. EXPERT SYSTEMS WITH APPLICATIONS, v. 47, p. 1-13, . Web of Science Citations: 7. (11/13382-3)

DE ANDRADE, CARLOS EDUARDO; TOSO, RODRIGO FRANCO; RESENDE, MAURICIO G. C.; MIYAZAWA, FLAVIO KEIDI. Biased Random-Key Genetic Algorithms for theWinner Determination Problem in Combinatorial Auctions. EVOLUTIONARY COMPUTATION, v. 23, n. 2, p. 279-307, . Web of Science Citations: 6. (10/05233-5, 12/08222-0)

MEIRA, LUIS A. A.; MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.. Clustering through Continuous Facility Location Problems. THEORETICAL COMPUTER SCIENCE, v. 657, n. B, p. 137-145, . Web of Science Citations: 0. (10/20710-4)

MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S.; SVIRIDENKO, MAXIM; WAKABAYASHI, YOSHIKO. Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. ALGORITHMICA, v. 76, n. 2, p. 536-568, . Web of Science Citations: 5. (13/03447-6, 13/02434-8, 10/20710-4, 13/21744-8)

HOKAMA, PEDRO; MIYAZAWA, FLAVIO K.; SCHOUERY, RAFAEL C. S.. A bounded space algorithm for online circle packing. INFORMATION PROCESSING LETTERS, v. 116, n. 5, p. 337-342, . Web of Science Citations: 6. (11/13382-3, 13/21744-8)

POVOA, MARCELO G.; XAVIER, EDUARDO C.. Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems. International Transactions in Operational Research, v. 25, n. 5, p. 1417-1441, . Web of Science Citations: 0. (16/23552-7, 14/02104-0, 15/11937-9)

TICONA-ZEGARRA, EDSON; SCHOUERY, RAFAEL C. S.; VILLAS, LEANDRO A.; MIYAZAWA, FLAVIO K.. Improved continuous enhancement routing solution for energy-aware data aggregation in wireless sensor networks. International Journal of Distributed Sensor Networks, v. 14, n. 5, . Web of Science Citations: 1. (15/11937-9, 13/21744-8, 16/01860-1)

MELO, LUCAS P.; MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S.. Approximation algorithms for k-level stochastic facility location problems. JOURNAL OF COMBINATORIAL OPTIMIZATION, v. 34, n. 1, p. 266-278, . Web of Science Citations: 1. (13/21744-8)

OLIVEIRA, ANDRE RODRIGUES; DIAS, ULISSES; DIAS, ZANONI. On the Sorting by Reversals and Transpositions Problem. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, v. 23, n. 9, p. 868-906, . Web of Science Citations: 1. (14/19401-8, 13/08293-7, 15/11937-9)

PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S.. Approximation algorithms for the bus evacuation problem. JOURNAL OF COMBINATORIAL OPTIMIZATION, v. 36, n. 1, p. 131-141, . Web of Science Citations: 0. (15/11937-9)

LINTZMAYER, CARLA NEGRI; FERTIN, GUILLAUME; DIAS, ZANONI. Sorting permutations by prefix and suffix rearrangements. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, v. 15, n. 1, . Web of Science Citations: 3. (14/19401-8, 13/01172-0, 13/08293-7, 15/11937-9, 14/20738-7, 16/14132-4)

DE QUEIROZ, THIAGO ALVES; DEL BIANCO HOKAMA, PEDRO HENRIQUE; SALIBA SCHOUERY, RAFAEL CRIVELLARI; MIYAZAWA, FLAVIO KEIDI. Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches. COMPUTERS & INDUSTRIAL ENGINEERING, v. 105, p. 313-328, . Web of Science Citations: 4. (11/13382-3, 13/21744-8)

MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S.; DE SOUZA, RENATA G. D.. A PTAS for the Geometric Connected Facility Location Problem. THEORY OF COMPUTING SYSTEMS, v. 61, n. 3, p. 871-892, . Web of Science Citations: 0. (14/14209-1, 13/21744-8)

PEDROSA, LEHILTON L. C.; SVIRIDENKO, MAXIM. Integrated Supply Chain Management via Randomized Rounding. INFORMS JOURNAL ON COMPUTING, v. 30, n. 1, p. 124-136, . Web of Science Citations: 0. (12/17634-0)

LINTZMAYER, CARLA NEGRI; FERTIN, GUILLAUME; DIAS, ZANONI. Sorting permutations and binary strings by length-weighted rearrangements. THEORETICAL COMPUTER SCIENCE, v. 715, p. 35-59, . Web of Science Citations: 0. (14/20738-7, 14/19401-8, 13/01172-0, 15/11937-9, 13/08293-7)

FERNANDES, CRISTINA G.; MEIRA, LUIS A. A.; MIYAZAWA, FLAVIO K.; PEDROSA, LEHILTON L. C.. A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. MATHEMATICAL PROGRAMMING, v. 153, n. 2, p. 655-685, . Web of Science Citations: 7. (10/20710-4)

SANTOS MIRANDA, GUILHERME HENRIQUE; LINTZMAYER, CARLA NEGRI; DIAS, ZANONI. Sorting Permutations by lambda-Operations. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, v. 25, n. 2, p. 98-121, . Web of Science Citations: 0. (17/12646-3, 13/08293-7, 15/11937-9, 16/14132-4)

ABOULKER, PIERRE; COHEN, NATHANN; HAVET, FREDERIC; LOCHET, WILLIAM; MOURA, PHABLO F. S.; THOMASSE, STEPHAN. Subdivisions in digraphs of large out-degree or large dichromatic number. ELECTRONIC JOURNAL OF COMBINATORICS, v. 26, n. 3, . Web of Science Citations: 0. (15/11930-4, 16/21250-3, 17/22611-2, 13/19179-0)

FERNANDES, CRISTINA G.; SCHOUERY, RAFAEL C. S.. Approximation Algorithms for the Max-Buying Problem with Limited Supply. ALGORITHMICA, v. 80, n. 11, p. 2973-2992, . Web of Science Citations: 0. (13/03447-6, 15/11937-9, 13/21744-8)

YUCRA QUISPE, KENT E.; LINTZMAYER, CARLA N.; XAVIER, EDUARDO C.. An exact algorithm for the Blocks Relocation Problem with new lower bounds. Computers & Operations Research, v. 99, p. 206-217, . Web of Science Citations: 3. (16/23552-7, 16/14132-4, 15/11937-9)

QUEIROZ, THIAGO A.; BRACHT, EVANDRO C.; MIYAZAWA, FLAVIO K.; BITTENCOURT, MARCO L.. An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability. ENGINEERING OPTIMIZATION, v. 51, n. 6, p. 1049-1070, . Web of Science Citations: 0. (16/23552-7, 16/01860-1, 15/11937-9)

BOTLER, FABIO; SAMBINELLI, MAYCON; COELHO, RAFAEL S.; LEE, ORLANDO. Gallai's path decomposition conjecture for graphs with treewidth at most 3. JOURNAL OF GRAPH THEORY, . Web of Science Citations: 0. (17/23623-4, 13/03447-6, 15/11937-9)

WAINER, JACQUES; XAVIER, EDUARDO C.. A Controlled Experiment on Python vs C for an Introductory Programming Course: Student's Outcomes. ACM TRANSACTIONS ON COMPUTING EDUCATION, v. 18, n. 3, . Web of Science Citations: 0. (16/23552-7, 15/11937-9)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

ANDRADE, Carlos Eduardo de. Um algoritmo exato para o problema de empacotamento bidimensional em faixas. 2006. Dissertação (Mestrado) - Instituto de Computação. Universidade Estadual de Campinas (UNICAMP). (04/12711-0)

BRACHT, Evandro Cesar. Algoritmos de aproximação para o problema de classificação metrica. 2004. Dissertação (Mestrado) - Instituto de Computação. Universidade Estadual de Campinas (UNICAMP). (01/12166-3)

QUEIROZ, Thiago Alves de. Algoritmos para problemas de corte e empacotamento. 2010. Tese (Doutorado) – Instituto de Computação. Universidade Estadual de Campinas (UNICAMP). (09/01129-1)

HOKAMA, Pedro Henrique Del Bianco. O problema do caixeiro viajante com restrições de empacotamento tridimensional. 2011. Dissertação (Mestrado) - Instituto de Computação. Universidade Estadual de Campinas (UNICAMP). (09/13270-0)

SILVA, Francisco Jhonatas Melo da. Game-theoretic analysis of transportation problems : Análise de problemas de transporte sob a perspectiva da teoria de jogos. 2018. Dissertação (Mestrado) - (17/05223-9)

BRACHT, Evandro Cesar. Problemas de empacotamento com restrições de equilíbrio mecânico. 2016. Tese (Doutorado) – Universidade Estadual de Campinas, Instituto de Computação. (03/13815-0)

PEREIRA, Vinicius de Novaes Guimarães. O leilão GSP e preço da anarquia. 2013. Dissertação (Mestrado) - Instituto de Computação. Universidade Estadual de Campinas (UNICAMP). (10/14666-2)

XAVIER, Eduardo Candido. Algoritmos de aproximação para problemas de escalonamento de tarefas em maquinas. 2003. Dissertação (Mestrado) - Instituto de Computação. Universidade Estadual de Campinas. (01/04412-4)

ANDRADE, Carlos Eduardo de. Evolutionary algorithms for some problems in telecommunications = : Algoritmos evolutivos para alguns problemas em telecomunicações. 2015. Tese (Doutorado) – Instituto de Computação. Universidade Estadual de Campinas. (10/05233-5)

None

PEDROSA, Lehilton Lelis Chaves. Approximation algorithms for facility location problems and other supply chain problems. 2014. Tese (Doutorado) – Instituto de Computação. Universidade Estadual de Campinas. (10/20710-4)

BORGES, Yulle Glebbyo Felipe. Branch-and-price algorithms for the class constrained bin packing problem = Algoritmos branch-and-price para o problema de empacotamento em recipientes com restrições de classe. 2016. Dissertação (Mestrado) - (14/25892-4)

Distribution map of accesses to this page
Click here to view the access summary to this page.
Please report errors in researcher information by writing to: cdi@fapesp.br.
X

Report errors in this page


Error details: