default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé-Fernando Camacho-Vallejo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Miguel Gastón Cedillo-Campos
, Rosa G. González-Ramírez, José-Fernando Camacho-Vallejo, Jesus René Villalobos:
Territory-driven decision-making in industrial supply chains reconfiguration. Comput. Ind. Eng. 187: 109827 (2024)- [j24]José-Fernando Camacho-Vallejo, Carlos Corpus, Juan G. Villegas:
Metaheuristics for bilevel optimization: A comprehensive review. Comput. Oper. Res. 161: 106410 (2024) - [j23]Juan-Carlos García-Vélez, Diego Ruiz-Hernández, José-Fernando Camacho-Vallejo, Juan A. Díaz:
Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem. Comput. Oper. Res. 161: 106418 (2024) - [j22]Rafael García-Jiménez, Juan Carlos García-Díaz, Alexander D. Pulido-Rojano, José-Fernando Camacho-Vallejo:
Packaging process optimization for multihead weighing machines with vertical and diagonal double-layered systems: A bi-level approach. Expert Syst. Appl. 240: 122591 (2024) - [j21]José Emmanuel Gómez-Rocha, Eva Selene Hernández-Gress, José-Fernando Camacho-Vallejo, Cipriano Santos:
An enhanced benders decomposition method and a matheuristic algorithm for solving the stochastic capacitated facility location problem with shortages. Expert Syst. Appl. 255: 124802 (2024) - [j20]Sahori Polino, José-Fernando Camacho-Vallejo, Juan G. Villegas:
A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics. Int. Trans. Oper. Res. 31(6): 4025-4067 (2024) - [j19]José-Fernando Camacho-Vallejo, Juan-Carlos García-Vélez, Carlos Corpus:
A 5G Hubs Location Hierarchized Problem that Balances the Connection of the Users. Mob. Networks Appl. 29(1): 98-108 (2024) - [c4]José-Fernando Camacho-Vallejo, Carlos Corpus:
A Nested Evolutionary Algorithm for Solving a Bilevel Competitive Location Problem: Optimistic vs. Pessimistic Approaches. CEC 2024: 1-8 - [c3]José-Fernando Camacho-Vallejo, Eva Selene Hernández-Gress, Carlos Corpus:
Promoting Regional Economic Welfare for Microstores via Nearshoring Strategies. ICCL 2024: 269-283 - 2023
- [j18]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) - [j17]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) - 2022
- [j16]José-Fernando Camacho-Vallejo, Lilian López-Vera, Alice E. Smith, José Luis González Velarde:
A tabu search algorithm to solve a green logistics bi-objective bi-level problem. Ann. Oper. Res. 316(2): 927-953 (2022) - [j15]Norberto A. Hernández-Leandro, Omar Jorge Ibarra-Rojas, José-Fernando Camacho-Vallejo:
A bi-objective humanitarian logistics model considering equity in the affected zones: application to a recent earthquake in Mexico. RAIRO Oper. Res. 56(3): 1737-1762 (2022) - 2020
- [j14]Herminia I. Calvete, Carmen Galé, José A. Iranzo, José-Fernando Camacho-Vallejo, Martha-Selene Casas-Ramírez:
A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences. Comput. Oper. Res. 124: 105066 (2020) - [j13]Martha-Selene Casas-Ramírez, José-Fernando Camacho-Vallejo, Juan A. Díaz, Dolores E. Luna:
A bi-level maximal covering location problem. Oper. Res. 20(2): 827-855 (2020) - [j12]José-Fernando Camacho-Vallejo, Cristóbal Garcia-Reyes:
Approximating the Pareto front of a bi-objective problem in telecommunication networks using a co-evolutionary algorithm. Wirel. Networks 26(7): 4881-4893 (2020)
2010 – 2019
- 2019
- [j11]José-Fernando Camacho-Vallejo, Cristóbal Garcia-Reyes:
Co-evolutionary algorithms to solve hierarchized Steiner tree problems in telecommunication networks. Appl. Soft Comput. 84 (2019) - [j10]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) - [j9]Martha-Selene Casas-Ramírez, José-Fernando Camacho-Vallejo:
Analyzing valid bounds for a facility location bilevel problem with capacities. Int. J. Comb. Optim. Probl. Informatics 10(2): 8-16 (2019) - 2018
- [j8]Martha-Selene Casas-Ramírez, José-Fernando Camacho-Vallejo, Iris Abril Martínez-Salazar:
Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences. Appl. Math. Comput. 319: 369-386 (2018) - [j7]Martha-Selene Casas-Ramírez, José-Fernando Camacho-Vallejo, Rosa G. González-Ramírez, Jose Antonio Marmolejo Saucedo, José Manuel Velarde Cantú:
Optimizing a Biobjective Production-Distribution Planning Problem Using a GRASP. Complex. 2018: 3418580:1-3418580:13 (2018) - [j6]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) - 2017
- [j5]Martha-Selene Casas-Ramírez, José-Fernando Camacho-Vallejo:
Solving the p-median bilevel problem with order through a hybrid heuristic. Appl. Soft Comput. 60: 73-86 (2017) - [j4]Juan A. Díaz, Dolores E. Luna, José-Fernando Camacho-Vallejo, Martha-Selene Casas-Ramírez:
GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering. Expert Syst. Appl. 82: 67-76 (2017) - [i1]Francisco López-Ramos, Armando Guarnaschelli, José-Fernando Camacho-Vallejo, Laura Hervert-Escobar, Rosa G. González-Ramírez:
Tramp Ship Scheduling Problem with Berth Allocation Considerations and Time-dependent Constraints. CoRR abs/1705.01681 (2017) - 2016
- [j3]Javier Morales, Victor Tercero-Gomez, José-Fernando Camacho-Vallejo, Alvaro Cordero-Franco, Luis E. López Nerio, F.-Javier Almaguer:
Trend and fractality assessment of Mexico's stock exchange. Appl. Math. Comput. 285: 103-113 (2016) - [c2]Francisco López-Ramos, Armando Guarnaschelli, José-Fernando Camacho-Vallejo, Laura Hervert-Escobar, Rosa G. González-Ramírez:
Tramp Ship Scheduling Problem with Berth Allocation Considerations and Time-Dependent Constraints. MICAI (1) 2016: 346-361 - 2015
- [j2]José-Fernando Camacho-Vallejo, Rafael Muñoz-Sánchez, José Luis González Velarde:
A heuristic algorithm for a supply chain's production-distribution planning. Comput. Oper. Res. 61: 110-121 (2015) - [j1]José Luis González Velarde, José-Fernando Camacho-Vallejo, Gabriel Pinto Serrano:
A Scatter Search Algorithm for Solving a Bilevel Optimization Model for Determining Highway Tolls. Computación y Sistemas 19(1) (2015)
2000 – 2009
- 2008
- [c1]Vyacheslav Kalashnikov, Nataliya I. Kalashnykova, José-Fernando Camacho-Vallejo:
Solving Bilevel Toll Assignment Problem by Penalty Function Algorithm. ISDA (3) 2008: 62-66
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-11-07 21:31 CET 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:
