default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamuel Nucamendi-Guillén
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Edith Salinas, José-Fernando Camacho-Vallejo
, Samuel Nucamendi-Guillén:
A Bi-Level Vaccination Points Location Problem That Aims at Social Distancing and Equity for the Inhabitants. Axioms 12(3): 305 (2023)- [j14]José-Fernando Camacho-Vallejo, Dámaris Dávila, Samuel Nucamendi-Guillén:
A hierarchized green supply chain with customer selection, routing, and nearshoring. Comput. Ind. Eng. 178: 109151 (2023) - [j13]Valeria Soto-Mendoza, Efraín Ruiz-y-Ruiz, Irma D. García-Calvillo, Samuel Nucamendi-Guillén, Yajaira Cardona-Valdés:
A location-routing problem for local supply chains. Comput. Ind. Eng. 183: 109528 (2023) - [j12]Yajaira Cardona-Valdés, Samuel Nucamendi-Guillén, Luis A. Ricardez-Sandoval:
A capacitated lot-sizing problem in the industrial fashion sector under uncertainty: a conditional value-at-risk framework. Int. J. Prod. Res. 61(21): 7181-7197 (2023) - 2022
- [j11]Karina Corona-Gutiérrez, Samuel Nucamendi-Guillén, Eduardo Lalla-Ruiz:
Vehicle routing with cumulative objectives: A state of the art and analysis. Comput. Ind. Eng. 169: 108054 (2022) - [j10]Samuel Nucamendi-Guillén, Iris Martínez-Salazar, Sara Khodaparasti, Maria Elena Bruni:
New formulations and solution approaches for the latency location routing problem. Comput. Oper. Res. 143: 105767 (2022) - [j9]Héctor G.-de-Alba, Samuel Nucamendi-Guillén, Oliver Avalos-Rosales:
A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: Total tardiness minimization. EURO J. Comput. Optim. 10: 100034 (2022) - [j8]Maria Elena Bruni, Sara Khodaparasti, Iris Martínez-Salazar, Samuel Nucamendi-Guillén:
The multi-depot k-traveling repairman problem. Optim. Lett. 16(9): 2681-2709 (2022) - [j7]Efraín Ruiz-y-Ruiz, Irma D. García-Calvillo, Samuel Nucamendi-Guillén:
Open vehicle routing problem with split deliveries: mathematical formulations and a cutting-plane method. Oper. Res. 22(2): 1017-1037 (2022) - [j6]Jessica Rubiano-Moreno, Samuel Nucamendi-Guillén, Alvaro Cordero-Franco, Alejandro Rodríguez-Magaña:
An improved LINMAP for multicriteria decision: designing customized incentive portfolios in an organization. Oper. Res. 22(4): 3489-3520 (2022) - 2021
- [j5]Samuel Nucamendi-Guillén, Alejandra Gomez-Padilla, Elías Olivares Benítez, J. Marcos Moreno-Vega:
The multi-depot open location routing problem with a heterogeneous fixed fleet. Expert Syst. Appl. 165: 113846 (2021) - [c4]Joel-Novi Rodríguez-Escoto, Samuel Nucamendi-Guillén, Elías Olivares Benítez:
Analysis of the Hiring Cost Impact with a Bi-objective Model for the Multi-depot Open Location Routing Problem. ICORES 2021: 425-432 - 2020
- [c3]Maria Elena Bruni, Sara Khodaparasti, Samuel Nucamendi-Guillén:
The Bi-objective Minimum Latency Problem with Profit Collection and Uncertain Travel Times. ICORES 2020: 109-118
2010 – 2019
- 2019
- [j4]José-Fernando Camacho-Vallejo, Samuel Nucamendi-Guillén, Rosa G. González-Ramírez:
An optimization framework for the distribution process of a manufacturing company balancing deliverymen workload and customer's waiting times. Comput. Ind. Eng. 137 (2019) - [c2]Gustavo Macedo-Barragán, Samuel Nucamendi-Guillén, Elías Olivares Benítez, Omar Rojas:
The Capacitated Lot Sizing Problem with Batch Ordering: A MILP and Heuristic Approach. ICORES 2019: 229-236 - [c1]Narda E. Ibarra-Delgado, Elías Olivares Benítez, Samuel Nucamendi-Guillén, Omar Rojas:
Maximization of Profit for a Problem of Location and Routing, with Price-sensitive Demands. ICORES 2019: 414-421 - 2018
- [j3]Samuel Nucamendi-Guillén, Francisco Ángel-Bello, Iris Martínez-Salazar, Alvaro Cordero-Franco:
The cumulative capacitated vehicle routing problem: New formulations and iterated greedy algorithms. Expert Syst. Appl. 113: 315-327 (2018) - [j2]Samuel Nucamendi-Guillén, Dámaris Dávila, José-Fernando Camacho-Vallejo, Rosa G. González-Ramírez:
A discrete bilevel brain storm algorithm for solving a sales territory design problem: a case study. Memetic Comput. 10(4): 441-458 (2018) - 2016
- [j1]Samuel Nucamendi-Guillén, Iris Martínez-Salazar, Francisco Ángel-Bello, J. Marcos Moreno-Vega:
A mixed integer formulation and an efficient metaheuristic procedure for the k-Travelling Repairmen Problem. J. Oper. Res. Soc. 67(8): 1121-1134 (2016)
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:02 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:
