default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYasmín Á. Ríos-Solís
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Saúl Domínguez-Casasola
, José Luis González Velarde, Yasmín Á. Ríos-Solís, Kevin Alain Reyes-Vega:
The capacitated family traveling salesperson problem. Int. Trans. Oper. Res. 31(4): 2123-2153 (2024)- 2023
- [j13]Citlali M. Olvera-Toscano, Yasmín Á. Ríos-Solís, Roger Z. Ríos-Mercado, Romeo Sanchez Nigenda:
Holding times to maintain quasi-regular headways and reduce real-time bus bunching. Public Transp. 15(3): 595-628 (2023) - 2021
- [j12]Mathieu Lacroix, Yasmín Á. Ríos-Solís, Roberto Wolfler Calvo:
Efficient formulations for the traveling car renter problem and its quota variant. Optim. Lett. 15(6): 1905-1930 (2021) - 2020
- [j11]Yasmín Á. Ríos-Solís, Omar Jorge Ibarra-Rojas, Marta Cabo, Edgar Possani:
A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production. Eur. J. Oper. Res. 284(3): 861-873 (2020)
2010 – 2019
- 2019
- [j10]Fernando Elizalde-Ramírez, Romeo Sanchez Nigenda, Iris Abril Martínez-Salazar, Yasmín Á. Ríos-Solís:
Travel Plans in Public Transit Networks Using Artificial Intelligence Planning Models. Appl. Artif. Intell. 33(5): 440-461 (2019) - 2018
- [j9]Marta Cabo, José Luis González Velarde, Edgar Possani, Yasmín Á. Ríos-Solís:
Bi-objective scheduling on a restricted batching machine. Comput. Oper. Res. 100: 201-210 (2018) - 2016
- [j8]Pierre Fouilhoux, Omar Jorge Ibarra-Rojas, Safia Kedad-Sidhoum, Yasmín Á. Ríos-Solís:
Valid inequalities for the synchronization bus timetabling problem. Eur. J. Oper. Res. 251(2): 442-450 (2016) - [j7]Omar Jorge Ibarra-Rojas, Fernando López Irarragorri, Yasmín Á. Ríos-Solís:
Multiperiod Bus Timetabling. Transp. Sci. 50(3): 805-822 (2016) - 2013
- [j6]Epameinondas Fritzilas, Martin Milanic, Jérôme Monnot, Yasmín Á. Ríos-Solís:
Resilience and optimization of identifiable bipartite graphs. Discret. Appl. Math. 161(4-5): 593-603 (2013) - 2010
- [j5]Epameinondas Fritzilas, Martin Milanic, Sven Rahmann, Yasmín Á. Ríos-Solís:
Structural Identifiability in Low-Rank Matrix Factorization. Algorithmica 56(3): 313-332 (2010) - [j4]Marie-Christine Plateau, Yasmín Á. Ríos-Solís:
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations. Eur. J. Oper. Res. 201(3): 729-736 (2010)
2000 – 2009
- 2008
- [j3]Yasmín Á. Ríos-Solís:
Scheduling with earliness-tardiness penalties and parallel machines. 4OR 6(2): 191-194 (2008) - [j2]Yasmín Á. Ríos-Solís, Francis Sourd:
Exponential neighborhood search for a parallel machine scheduling problem. Comput. Oper. Res. 35(5): 1697-1712 (2008) - [j1]Safia Kedad-Sidhoum, Yasmín Á. Ríos-Solís, Francis Sourd:
Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates. Eur. J. Oper. Res. 189(3): 1305-1316 (2008) - [c1]Epameinondas Fritzilas, Yasmín Á. Ríos-Solís, Sven Rahmann:
Structural Identifiability in Low-Rank Matrix Factorization. COCOON 2008: 140-148
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-10-07 21:12 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:
