M. Angélica Salazar-Aguilar

Orcid: 0000-0001-5272-4105

According to our database1, M. Angélica Salazar-Aguilar authored at least 23 papers between 2011 and 2026.

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

2026
The orienteering problem with mandatory visits and conflicts: a branch and cut approach.
J. Oper. Res. Soc., June, 2026

Branch and cut for the team orienteering problem with nonidentical agents and balanced score.
Expert Syst. Appl., 2026

2025
The Dial-a-Tour Problem.
Comput. Oper. Res., 2025

2023
Team orienteering problem with nonidentical agents and balanced score.
Int. J. Prod. Res., December, 2023

Solving Location Assignment and Order Picker-Routing Problems in Warehouse Management.
Axioms, July, 2023

2021
The generalized flexible job shop scheduling problem.
Comput. Ind. Eng., 2021

2019
The bi-objective traveling purchaser problem with deliveries.
Eur. J. Oper. Res., 2019

A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem.
Eur. J. Oper. Res., 2019

The sales force sizing problem with multi-period workload assignments, and service time windows.
Central Eur. J. Oper. Res., 2019

2018
Multi-depot periodic vehicle routing problem with due dates and time windows.
J. Oper. Res. Soc., 2018

Flexible job-shop scheduling problem with resource recovery constraints.
Int. J. Prod. Res., 2018

2017
A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraints.
Comput. Oper. Res., 2017

Planning a selective delivery schedule through Adaptive Large Neighborhood Search.
Comput. Ind. Eng., 2017

Formulations for the orienteering problem with additional constraints.
Ann. Oper. Res., 2017

The multi-vehicle cumulative covering tour problem.
Ann. Oper. Res., 2017

2014
The multi-district team orienteering problem.
Comput. Oper. Res., 2014

2013
GRASP strategies for a bi-objective commercial territory design problem.
J. Heuristics, 2013

The synchronized arc and node routing problem: Application to road marking.
Comput. Oper. Res., 2013

2012
Commercial Territory Design for a Distribution Firm with New Constructive and Destructive Heuristics.
Int. J. Comput. Intell. Syst., 2012

Procedimiento divide y vencerás para el diseño de territorios comerciales.
Computación y Sistemas, 2012

Synchronized arc routing for snow plowing operations.
Comput. Oper. Res., 2012

Multiobjective scatter search for a commercial territory design problem.
Ann. Oper. Res., 2012

2011
An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes.
Proceedings of the Network Optimization - 5th International Conference, 2011


  Loading...