Samuel Nucamendi-Guillén

Orcid: 0000-0003-4169-3395

According to our database1, Samuel Nucamendi-Guillén authored at least 19 papers between 2016 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A capacitated lot-sizing problem in the industrial fashion sector under uncertainty: a conditional value-at-risk framework.
Int. J. Prod. Res., November, 2023

A location-routing problem for local supply chains.
Comput. Ind. Eng., September, 2023

A hierarchized green supply chain with customer selection, routing, and nearshoring.
Comput. Ind. Eng., 2023

A Bi-Level Vaccination Points Location Problem That Aims at Social Distancing and Equity for the Inhabitants.
Axioms, 2023

2022
Open vehicle routing problem with split deliveries: mathematical formulations and a cutting-plane method.
Oper. Res., 2022

An improved LINMAP for multicriteria decision: designing customized incentive portfolios in an organization.
Oper. Res., 2022

The multi-depot k-traveling repairman problem.
Optim. Lett., 2022

A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: Total tardiness minimization.
EURO J. Comput. Optim., 2022

New formulations and solution approaches for the latency location routing problem.
Comput. Oper. Res., 2022

Vehicle routing with cumulative objectives: A state of the art and analysis.
Comput. Ind. Eng., 2022

2021
The multi-depot open location routing problem with a heterogeneous fixed fleet.
Expert Syst. Appl., 2021

Analysis of the Hiring Cost Impact with a Bi-objective Model for the Multi-depot Open Location Routing Problem.
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021

2020
The Bi-objective Minimum Latency Problem with Profit Collection and Uncertain Travel Times.
Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, 2020

2019
An optimization framework for the distribution process of a manufacturing company balancing deliverymen workload and customer's waiting times.
Comput. Ind. Eng., 2019

The Capacitated Lot Sizing Problem with Batch Ordering: A MILP and Heuristic Approach.
Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019

Maximization of Profit for a Problem of Location and Routing, with Price-sensitive Demands.
Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019

2018
A discrete bilevel brain storm algorithm for solving a sales territory design problem: a case study.
Memetic Comput., 2018

The cumulative capacitated vehicle routing problem: New formulations and iterated greedy algorithms.
Expert Syst. Appl., 2018

2016
A mixed integer formulation and an efficient metaheuristic procedure for the <i>k</i>-Travelling Repairmen Problem.
J. Oper. Res. Soc., 2016


  Loading...