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)

News published in Agência FAPESP Newsletter about the researcher
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)
Research grants
Scholarships in Brazil
Scholarships abroad
FAPESP support in numbers * Updated January 15, 2022
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 (60)

(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)

Publications65
Citations58
Cit./Article0.9
Data from Web of Science

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)

MUNOZ, JAVIER VARGAS; GONCALVES, MARCOS A.; DIAS, ZANONI; TORRES, RICARDO DA S.. Hierarchical Clustering-Based Graphs for Large Scale Approximate Nearest Neighbor Search. PATTERN RECOGNITION, v. 96, . Web of Science Citations: 0. (14/50715-9, 16/50250-1, 17/16246-0, 17/20945-0, 14/12236-1, 13/50169-1, 15/11937-9, 17/12646-3, 13/50155-0, 15/24494-8)

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)

OLIVEIRA, ANDRE R.; JEAN, GERALDINE; FERTIN, GUILLAUME; DIAS, ULISSES; DIAS, ZANONI. Super short operations on both gene order and intergenic sizes. Algorithms for Molecular Biology, v. 14, n. 1, . Web of Science Citations: 0. (17/12646-3, 17/16246-0, 13/08293-7, 15/11937-9)

OLIVEIRA, ANDRE RODRIGUES; BRITO, KLAIRTON LIMA; DIAS, ULISSES; DIAS, ZANONI. On the Complexity of Sorting by Reversals and Transpositions Problems. JOURNAL OF COMPUTATIONAL BIOLOGY, v. 26, n. 11, p. 1223-1229, . Web of Science Citations: 1. (13/08293-7, 17/12646-3, 15/11937-9, 17/16246-0)

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)

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)

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)

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. (13/08293-7, 14/19401-8, 15/11937-9)

IORI, MANUEL; DE LIMA, VINICIUS L.; MARTELLO, SILVANO; MIYAZAWA, FLAVIO K.; MONACI, MICHELE. Exact solution techniques for two-dimensional cutting and packing. European Journal of Operational Research, v. 289, n. 2, p. 399-415, . Web of Science Citations: 0. (18/19217-3, 16/23552-7, 19/12728-5, 16/01860-1, 15/11937-9)

ALEXANDRINO, ALEXSANDRO OLIVEIRA; MIRANDA, GUILHERME HENRIQUE SANTOS; LINTZMAYER, CARLA NEGRI; DIAS, ZANONI. Length-weighted lambda-rearrangement distance. JOURNAL OF COMBINATORIAL OPTIMIZATION, v. 41, n. 3, . Web of Science Citations: 0. (17/16246-0, 17/12646-3, 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. (14/14375-9, 15/04385-0, 15/11937-9)

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)

LINTZMAYER, CARLA NEGRI; FERTIN, GUILLAUME; DIAS, ZANONI. Sorting permutations by prefix and suffix rearrangements. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, v. 15, n. 1, . (14/19401-8, 13/01172-0, 15/11937-9, 14/20738-7, 13/08293-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, . (13/21744-8, 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, . (10/05233-5, 12/08222-0)

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, . (10/20710-4)

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, . (10/20710-4)

DUARTE, GABRIEL L.; ETO, HIROSHI; HANAKA, TESSHU; KOBAYASHI, YASUAKI; KOBAYASHI, YUSUKE; LOKSHTANOV, DANIEL; PEDROSA, LEHILTON L. C.; SCHOUERY, RAFAEL C. S.; SOUZA, UEVERTON S.. Computing the Largest Bond and the Maximum Connected Cut of a Graph. ALGORITHMICA, v. 83, n. 5, p. 1421-1458, . Web of Science Citations: 0. (15/11937-9)

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: 5. (11/13382-3, 13/21744-8)

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)

ALEXANDRINO, ALEXSANDRO OLIVEIRA; OLIVEIRA, ANDRE RODRIGUES; DIAS, ULISSES; DIAS, ZANONI. On the Complexity of Some Variations of Sorting by Transpositions. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, v. 26, n. 9, p. 1076-1094, . Web of Science Citations: 0. (13/08293-7, 15/11937-9, 19/27331-3, 17/12646-3)

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)

MUNOZ, JAVIER VARGAS; GONCALVES, MARCOS A.; DIAS, ZANONI; TORRES, RICARDO DA S.. Hierarchical Clustering-Based Graphs for Large Scale Approximate Nearest Neighbor Search. PATTERN RECOGNITION, v. 96, . Web of Science Citations: 0. (14/50715-9, 16/50250-1, 17/16246-0, 17/20945-0, 14/12236-1, 13/50169-1, 15/11937-9, 17/12646-3, 13/50155-0, 15/24494-8)

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)

OLIVEIRA, ANDRE R.; JEAN, GERALDINE; FERTIN, GUILLAUME; DIAS, ULISSES; DIAS, ZANONI. Super short operations on both gene order and intergenic sizes. Algorithms for Molecular Biology, v. 14, n. 1, . Web of Science Citations: 0. (17/12646-3, 17/16246-0, 13/08293-7, 15/11937-9)

OLIVEIRA, ANDRE RODRIGUES; BRITO, KLAIRTON LIMA; DIAS, ULISSES; DIAS, ZANONI. On the Complexity of Sorting by Reversals and Transpositions Problems. JOURNAL OF COMPUTATIONAL BIOLOGY, v. 26, n. 11, p. 1223-1229, . Web of Science Citations: 1. (13/08293-7, 17/12646-3, 15/11937-9, 17/16246-0)

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)

ALEXANDRINO, ALEXSANDRO OLIVEIRA; OLIVEIRA, ANDRE RODRIGUES; DIAS, ULISSES; DIAS, ZANONI. On the Complexity of Some Variations of Sorting by Transpositions. JOURNAL OF UNIVERSAL COMPUTER SCIENCE, v. 26, n. 9, p. 1076-1094, . Web of Science Citations: 0. (13/08293-7, 15/11937-9, 19/27331-3, 17/12646-3)

OLIVEIRA, ANDRE RODRIGUES; JEAN, GERALDINE; FERTIN, GUILLAUME; BRITO, KLAIRTON LIMA; DIAS, ULISSES; DIAS, ZANONI. Sorting Permutations by Intergenic Operations. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, v. 18, n. 6, p. 2080-2093, . Web of Science Citations: 2. (13/08293-7, 19/27331-3, 17/12646-3, 15/11937-9)

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, . (08/01490-3)

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)

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; 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)

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)

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)

MUNOZ, JAVIER VARGAS; GONCALVES, MARCOS A.; DIAS, ZANONI; TORRES, RICARDO DA S.. Hierarchical Clustering-Based Graphs for Large Scale Approximate Nearest Neighbor Search. PATTERN RECOGNITION, v. 96, . Web of Science Citations: 0. (14/50715-9, 16/50250-1, 17/16246-0, 17/20945-0, 14/12236-1, 13/50169-1, 15/11937-9, 17/12646-3, 13/50155-0, 15/24494-8)

ALEXANDRINO, ALEXSANDRO OLIVEIRA; LINTZMAYER, CARLA NEGRI; DIAS, ZANONI. Sorting permutations by fragmentation-weighted operations. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, v. 18, n. 2, . Web of Science Citations: 0. (17/12646-3, 17/16871-1, 17/16246-0, 15/11937-9)

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: 4. (15/11937-9, 16/23552-7, 16/14132-4)

MOURA, PHABLO F. S.; WAKABAYASHI, YOSHIKO. Strong intractability results for generalized convex recoloring problems. DISCRETE APPLIED MATHEMATICS, v. 281, n. SI, p. 252-260, . Web of Science Citations: 0. (16/21250-3, 17/22611-2, 15/11937-9)

BORGES, YULLE G. F.; MIYAZAWA, FLAVIO K.; SCHOUERY, RAFAEL C. S.; XAVIER, EDUARDO C.. Exact algorithms for class-constrained packing problems. COMPUTERS & INDUSTRIAL ENGINEERING, v. 144, . Web of Science Citations: 1. (15/11937-9, 16/23552-7, 14/25892-4, 16/01860-1)

GOMEZ, RENZO; WAKABAYASHI, YOSHIKO. Nontrivial path covers of graphs: existence, minimization and maximization. JOURNAL OF COMBINATORIAL OPTIMIZATION, . Web of Science Citations: 0. (15/11937-9)

BORGES, YULLE G. F.; SCHOUERY, RAFAEL C. S.; MIYAZAWA, FLAVIO K.; GRANELLI, FABRIZIO; DA FONSECA, NELSON L. S.; MELO, LUCAS P.. Smart energy pricing for demand-side management in renewable energy smart grids. International Transactions in Operational Research, v. 27, n. 6, . Web of Science Citations: 0. (16/23552-7, 13/21744-8, 15/11937-9, 16/01860-1)

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)

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)

OLIVEIRA, ANDRE R.; JEAN, GERALDINE; FERTIN, GUILLAUME; DIAS, ULISSES; DIAS, ZANONI. Super short operations on both gene order and intergenic sizes. Algorithms for Molecular Biology, v. 14, n. 1, . Web of Science Citations: 0. (17/12646-3, 17/16246-0, 13/08293-7, 15/11937-9)

OLIVEIRA, ANDRE RODRIGUES; BRITO, KLAIRTON LIMA; DIAS, ULISSES; DIAS, ZANONI. On the Complexity of Sorting by Reversals and Transpositions Problems. JOURNAL OF COMPUTATIONAL BIOLOGY, v. 26, n. 11, p. 1223-1229, . Web of Science Citations: 1. (15/11937-9, 17/12646-3, 13/08293-7, 17/16246-0)

ALEXANDRINO, ALEXSANDRO OLIVEIRA; OLIVEIRA, ANDRE RODRIGUES; DIAS, ULISSES; DIAS, ZANONI. Genome Rearrangement Distance with Reversals, Transpositions, and Indels. JOURNAL OF COMPUTATIONAL BIOLOGY, v. 28, n. 3, p. 235-247, . Web of Science Citations: 0. (17/16246-0, 19/27331-3, 15/11937-9, 17/12646-3)

DANTAS, ANA PAULA S.; DE SOUZA, CID C.; DIAS, ZANONI. A heuristic for the convex recoloring problem in graphs. International Transactions in Operational Research, . Web of Science Citations: 0. (15/11937-9, 17/12646-3, 17/16246-0, 18/04760-3)

KOHAYAKAWA, YOSHIHARU; MIYAZAWA, FLAVIO KEIDI; WAKABAYASHI, YOSHIKO. A tight lower bound for the online bounded space hypercube bin packing problem. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, v. 23, n. 3, . Web of Science Citations: 0. (18/04876-1, 15/11937-9, 16/01860-1)

ALEXANDRINO, ALEXSANDRO OLIVEIRA; OLIVEIRA, ANDRE RODRIGUES; DIAS, ULISSES; DIAS, ZANONI. Labeled Cycle Graph for Transposition and Indel Distance. JOURNAL OF COMPUTATIONAL BIOLOGY, . Web of Science Citations: 0. (17/12646-3, 13/08293-7, 15/11937-9, 19/27331-3)

BRITO, KLAIRTON LIMA; ALEXANDRINO, ALEXSANDRO OLIVEIRA; OLIVEIRA, ANDRE RODRIGUES; DIAS, ULISSES; DIAS, ZANONI. Reversals and transpositions distance with proportion restriction. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, v. 19, n. 4, . Web of Science Citations: 0. (19/27331-3, 17/12646-3, 17/16246-0, 13/08293-7, 15/11937-9)

SIQUEIRA, GABRIEL; BRITO, KLAIRTON LIMA; DIAS, ULISSES; DIAS, ZANONI. Heuristics for Genome Rearrangement Distance With Replicated Genes. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, v. 18, n. 6, p. 2094-2108, . Web of Science Citations: 1. (15/11937-9, 17/12646-3, 17/16246-0)

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)

BRITO, KLAIRTON L.; OLIVEIRA, ANDRE R.; ALEXANDRINO, ALEXSANDRO O.; DIAS, ULISSES; DIAS, ZANONI. An improved approximation algorithm for the reversal and transposition distance considering gene order and intergenic sizes. Algorithms for Molecular Biology, v. 16, n. 1, . Web of Science Citations: 0. (13/08293-7, 17/12646-3, 15/11937-9, 19/27331-3)

SIQUEIRA, GABRIEL; ALEXANDRINO, ALEXSANDRO OLIVEIRA; OLIVEIRA, ANDRE RODRIGUES; DIAS, ZANONI. Approximation algorithm for rearrangement distances considering repeated genes and intergenic regions. Algorithms for Molecular Biology, v. 16, n. 1, . Web of Science Citations: 0. (17/12646-3, 15/11937-9, 13/08293-7, 19/27331-3)

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, . (14/14209-1, 13/21744-8)

Academic Publications

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

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

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

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

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

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

None

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

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. Dissertação (Mestrado) -  Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP).  (14/25892-4

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

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

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

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

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

Please report errors in researcher information by writing to: cdi@fapesp.br.
X

Report errors in this page


Error details: