default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdna Ayako Hoshino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Roberto Baldacci
, Edna Ayako Hoshino, Alessandro Hill:
New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems. Eur. J. Oper. Res. 307(2): 538-553 (2023)- 2022
- [j10]Jean P. Tremeschin Torres, Edna Ayako Hoshino:
LP-based heuristics for the distinguishing string and substring selection problems. Ann. Oper. Res. 316(2): 1205-1234 (2022) - 2021
- [c6]Cecilia Lescano Osório, Edna Ayako Hoshino:
A branch-and-price algorithm for the ring/ring problem. LAGOS 2021: 516-522
2010 – 2019
- 2019
- [j9]Alessandro Hill, Roberto Baldacci, Edna Ayako Hoshino:
Capacitated ring arborescence problems with profits. OR Spectr. 41(2): 357-389 (2019) - [c5]Fabio Henrique N. Abe, Edna Ayako Hoshino, Alessandro Hill, Roberto Baldacci:
A Branch-and-Price Algorithm for the Ring-Tree Facility Location Problem. LAGOS 2019: 3-14 - 2018
- [j8]Diego P. Rubert, Edna Ayako Hoshino, Marília D. V. Braga, Jens Stoye, Fábio Viduani Martinez:
Computing the family-free DCJ similarity. BMC Bioinform. 19-S(6): 31-42 (2018) - [j7]Jean P. Tremeschin Torres, Emerson Silva, Edna Ayako Hoshino:
Heuristic approaches to the Distinguishing Substring Selection Problem. Electron. Notes Discret. Math. 66: 151-158 (2018) - 2017
- [j6]Roberto Baldacci, Alessandro Hill, Edna Ayako Hoshino, Andrew Lim:
Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms. Eur. J. Oper. Res. 262(3): 879-893 (2017) - [c4]Diego P. Rubert, Gabriela Medeiros, Edna Ayako Hoshino, Marília D. V. Braga, Jens Stoye, Fábio Viduani Martinez:
Algorithms for Computing the Family-Free Genomic Similarity Under DCJ. RECOMB-CG 2017: 76-100 - 2015
- [j5]Fabio Henrique N. Abe, Edna Ayako Hoshino, Alessandro Hill:
The Ring Tree Facility Location Problem. Electron. Notes Discret. Math. 50: 331-336 (2015) - [i1]Alessandro Hill, Edna Ayako Hoshino:
A branch and price algorithm for the capacitated ring tree problem. CTW 2015: 273-276 - 2012
- [j4]Edna Ayako Hoshino, Cid C. de Souza:
A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discret. Appl. Math. 160(18): 2728-2741 (2012) - 2011
- [j3]Edna Ayako Hoshino:
The minimum cut cover problem. Electron. Notes Discret. Math. 37: 255-260 (2011) - [j2]Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza:
A branch-and-price approach for the partition coloring problem. Oper. Res. Lett. 39(2): 132-137 (2011)
2000 – 2009
- 2009
- [j1]Edna Ayako Hoshino, Cid Carvalho de Souza:
A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem. Electron. Notes Discret. Math. 35: 103-108 (2009) - [c3]Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza:
A Branch-and-Price Approach for the Partition Coloring Problem. CTW 2009: 187-190 - 2008
- [c2]Edna Ayako Hoshino, Cid C. de Souza:
Column Generation Algorithms for the Capacitated m-Ring-Star Problem. COCOON 2008: 631-641 - [c1]Edna Ayako Hoshino, Cid C. de Souza:
Column Generation Algorithms for the Capacitated m-Ring-Star Problem. CTW 2008: 158-161
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
