Edna Ayako Hoshino

According to our database, Edna Ayako Hoshino authored at least 16 papers between 2008 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems.

Roberto Baldacci, Edna Ayako Hoshino, Alessandro Hill

Eur. J. Oper. Res., June, 2023

2022

LP-based heuristics for the distinguishing string and substring selection problems.

Jean P. Tremeschin Torres, Edna Ayako Hoshino

Ann. Oper. Res., 2022

2021

A branch-and-price algorithm for the ring/ring problem.

Cecilia Lescano Osório, Edna Ayako Hoshino

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2019

Capacitated ring arborescence problems with profits.

Alessandro Hill, Roberto Baldacci, Edna Ayako Hoshino

OR Spectr., 2019

A Branch-and-Price Algorithm for the Ring-Tree Facility Location Problem.

Fabio Henrique N. Abe, Edna Ayako Hoshino, Alessandro Hill, Roberto Baldacci

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

Heuristic approaches to the Distinguishing Substring Selection Problem.

Jean P. Tremeschin Torres, Emerson Silva, Edna Ayako Hoshino

Electron. Notes Discret. Math., 2018

Computing the family-free DCJ similarity.

Diego P. Rubert, Edna Ayako Hoshino, Marília D. V. Braga, Jens Stoye, Fábio Viduani Martinez

BMC Bioinform., 2018

2017

Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms.

Roberto Baldacci, Alessandro Hill, Edna Ayako Hoshino, Andrew Lim

Eur. J. Oper. Res., 2017

Algorithms for Computing the Family-Free Genomic Similarity Under DCJ.

Diego P. Rubert, Gabriela Medeiros, Edna Ayako Hoshino, Marília D. V. Braga, Jens Stoye, Fábio Viduani Martinez

Proceedings of the Comparative Genomics - 15th International Workshop, 2017

2015

The Ring Tree Facility Location Problem.

Fabio Henrique N. Abe, Edna Ayako Hoshino, Alessandro Hill

Electron. Notes Discret. Math., 2015

A branch and price algorithm for the capacitated ring tree problem.

Alessandro Hill, Edna Ayako Hoshino

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2012

A branch-and-cut-and-price approach for the capacitated m-ring-star problem.

Edna Ayako Hoshino, Cid C. de Souza

Discret. Appl. Math., 2012

2011

A branch-and-price approach for the partition coloring problem.

Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza

Oper. Res. Lett., 2011

The minimum cut cover problem.

Edna Ayako Hoshino

Electron. Notes Discret. Math., 2011

2008

Column Generation Algorithms for the Capacitated <i>m</i>-Ring-Star Problem.

Edna Ayako Hoshino, Cid C. de Souza

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Column Generation Algorithms for the Capacitated m-Ring-Star Problem.

Edna Ayako Hoshino, Cid C. de Souza

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008