Juan José Salazar González
Orcid: 0000-0001-5683-0271
According to our database1,
Juan José Salazar González
authored at least 105 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Eur. J. Oper. Res., March, 2024
2023
Comput. Oper. Res., 2023
2022
A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem.
Eur. J. Oper. Res., 2022
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022
Proceedings of the Computational Logistics - 13th International Conference, 2022
2021
A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints.
Transp. Sci., 2021
The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach.
Eur. J. Oper. Res., 2021
2019
Expert Syst. Appl., 2019
Eur. J. Oper. Res., 2019
Eur. J. Oper. Res., 2019
Eur. J. Oper. Res., 2019
Proceedings of the Computational Logistics - 10th International Conference, 2019
2018
Exact Approach for the Vehicle Routing Problem with Stochastic Demands and Preventive Returns.
Transp. Sci., 2018
Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem.
Comput. Oper. Res., 2018
An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018
Proceedings of the Computational Logistics - 9th International Conference, 2018
2017
Transp. Sci., 2017
Eur. J. Oper. Res., 2017
Eur. J. Oper. Res., 2017
Comput. Oper. Res., 2017
2016
Transp. Sci., 2016
Networks, 2016
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem.
Eur. J. Oper. Res., 2016
A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem.
Eur. J. Oper. Res., 2016
Electron. Notes Discret. Math., 2016
Comput. Oper. Res., 2016
2015
Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem.
Eur. J. Oper. Res., 2015
2014
A MIP-based approach to solve the prize-collecting local access network design problem.
Eur. J. Oper. Res., 2014
Comput. Oper. Res., 2014
Proceedings of the Privacy in Statistical Databases, 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Proceedings of the Vehicle Routing, 2014
2013
Oper. Res. Lett., 2013
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route.
Networks, 2013
Electron. Notes Discret. Math., 2013
A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem.
Electron. Notes Discret. Math., 2013
A column generation approach for a school bus routing problem with resource constraints.
Comput. Oper. Res., 2013
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach.
Comput. Oper. Res., 2013
2012
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem.
J. Heuristics, 2012
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach.
Comput. Oper. Res., 2012
2011
The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic.
Proceedings of the Network Optimization - 5th International Conference, 2011
Proceedings of the Network Optimization - 5th International Conference, 2011
2010
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading.
Networks, 2010
Electron. Notes Discret. Math., 2010
Electron. Notes Discret. Math., 2010
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems.
Comput. Oper. Res., 2010
Comput. Oper. Res., 2010
Proceedings of the Privacy in Statistical Databases, 2010
2009
Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion.
Networks, 2009
On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands.
Math. Program., 2009
Eur. J. Oper. Res., 2009
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem.
Comput. Oper. Res., 2009
2008
Electron. Notes Discret. Math., 2008
Comput. Oper. Res., 2008
2007
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints.
Transp. Sci., 2007
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms.
Networks, 2007
An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection.
J. Symb. Comput., 2007
A branch-and-cut algorithm for the continuous error localization problem in data cleaning.
Comput. Oper. Res., 2007
Comput. Oper. Res., 2007
2006
Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data.
Math. Program., 2006
Proceedings of the Privacy in Statistical Databases, 2006
Proceedings of the Hybrid Metaheuristics, Third International Workshop, 2006
2005
A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods.
Oper. Res., 2005
2004
Transp. Sci., 2004
J. Oper. Res. Soc., 2004
Mathematical models for applying cell suppression methodology in statistical data protection.
Eur. J. Oper. Res., 2004
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery.
Discret. Appl. Math., 2004
A New Tool for Applying Controlled Rounding to a Statistical Table in Microsoft Excel.
Proceedings of the Privacy in Statistical Databases: CASC Project International Workshop, 2004
Proceedings of the Privacy in Statistical Databases: CASC Project International Workshop, 2004
Proceedings of the Advances in Artificial Intelligence, 2004
2003
Stat. Comput., 2003
Oper. Res., 2003
Eur. J. Oper. Res., 2003
2002
Proceedings of the Inference Control in Statistical Databases, From Theory to Practice, 2002
2001
Manag. Sci., 2001
Proceedings of the Combinatorial Optimization, 2001
2000
1999
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control.
Math. Program., 1999
Discret. Appl. Math., 1999
1998
1997
Oper. Res., 1997
1995