Edna Ayako Hoshino

According to our database1, Edna Ayako Hoshino authored at least 13 papers between 2008 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Capacitated ring arborescence problems with profits.
OR Spectr., 2019

A Branch-and-Price Algorithm for the Ring-Tree Facility Location Problem.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018
Heuristic approaches to the Distinguishing Substring Selection Problem.
Electron. Notes Discret. Math., 2018

Computing the family-free DCJ similarity.
BMC Bioinform., 2018

2017
Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms.
Eur. J. Oper. Res., 2017

Algorithms for Computing the Family-Free Genomic Similarity Under DCJ.
Proceedings of the Comparative Genomics - 15th International Workshop, 2017

2015
The Ring Tree Facility Location Problem.
Electron. Notes Discret. Math., 2015

A branch and price algorithm for the capacitated ring tree problem.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2011
A branch-and-price approach for the partition coloring problem.
Oper. Res. Lett., 2011

The minimum cut cover problem.
Electron. Notes Discret. Math., 2011

2009
A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem.
Electron. Notes Discret. Math., 2009

2008
Column Generation Algorithms for the Capacitated <i>m</i>-Ring-Star Problem.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

Column Generation Algorithms for the Capacitated m-Ring-Star Problem.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008


  Loading...