Juan José Salazar González
Universidad de La Laguna
Professor, Mathematics
Spain
My co-authors include
Prof. Daniele Vigo
My Publications
VRP with stochastic demands and with a restocking policy
Transportation Science
October 2018
Balanced Vehicle Routing: Polyhedral Analysis and Branch-and-Cut Algorithm
European Journal of Operational Research
August 2018
The Periodic Vehicle Routing Problem with Driver Consistency
European Journal of Operational Research
August 2018
The Capacitated Vehicle Routing Problem: Stronger Bounds in Pseudo-Polynomial Time
European Journal of Operational Research
June 2018
The driver and vehicle routing problem
Computers & Operations Research
April 2018
Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling s...
Computers & Operations Research
April 2018
A Heuristic Approach to the Driver and Vehicle Routing Problem
January 2018
An exact algorithm for a Vehicle-and-Driver Scheduling Problem
Computers & Operations Research
May 2017
Solving the Team Orienteering Arc Routing Problem with a Column Generation Approach
European Journal of Operational Research
March 2017
Optimal Solutions to a Real-World Integrated Airline Scheduling Problem
Transportation Science
February 2017
An Algorithmic Framework for the Exact Solution of Tree-Star Problems
European Journal of Operational Research
February 2017
The connected facility location polytope
Discrete Applied Mathematics
September 2016
The ring/κ-rings network design problem: Model and branch-and-cut algorithm
Networks
June 2016
Hierarchical Survivable Network Design Problems
Electronic Notes in Discrete Mathematics
June 2016
Solving the Single Vehicle Routing Problem with Variable Capacity
Transportation Science
May 2016
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering pro...
European Journal of Operational Research
May 2016
A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling sales...
European Journal of Operational Research
May 2016
A branch-and-cut algorithm for two-level survivable network design problems
Computers & Operations Research
March 2016
Preface
Annals of Operations Research
November 2015
Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem
European Journal of Operational Research
August 2015
Preface
Networks
May 2015
Container stacking revenue management system: A fuzzy-based strategy for Valparaiso port
DYNA
May 2015
The split-demand one-commodity pickup-and-delivery travelling salesman problem
Transportation Research Part B Methodological
May 2015
Chapter 7: Pickup-and-Delivery Problems for People Transportation
November 2014
A branch-and-cut algorithm for the hub location and routing problem
Computers & Operations Research
October 2014
A MIP-based approach to solve the prize-collecting local access network design problem
European Journal of Operational Research
June 2014
Single liner shipping service design
Computers & Operations Research
May 2014
Enhanced controlled tabular adjustment
Computers & Operations Research
March 2014
Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-roste...
Omega
March 2014
Measuring cost efficiency in the presence of quasi-fixed inputs using dynamic Data Enve...
Maritime Economics & Logistics
January 2014
On the Asymmetric Connected Facility Location Polytope
January 2014
On the Asymmetric Connected Facility Location Polytope
January 2014
Further Developments with Perturbation Techniques to Protect Tabular Data
January 2014
The multi-commodity pickup-and-delivery traveling salesman problem
Networks
October 2013
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut ...
Computers & Operations Research
August 2013
A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pair...
Electronic Notes in Discrete Mathematics
June 2013
International Network Optimization Conference, Tenerife 2013
Electronic Notes in Discrete Mathematics
June 2013
Polynomial-time separation of Enhanced Reverse Multistar inequalities
Operations Research Letters
May 2013
A column generation approach for a school bus routing problem with resource constraints
Computers & Operations Research
February 2013
Statistical Confidentiality: Principles and Practice by George T. Duncan, Mark Elliot, ...
International Statistical Review
November 2012
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery trav...
Journal of Heuristics
September 2012
Reverse multistar inequalities and vehicle routing problems with a lower bound on the n...
Networks
August 2012
The Balanced Minimum Evolution Problem
INFORMS Journal on Computing
May 2012
Solving school bus routing using the multiple vehicle traveling purchaser problem: A br...
Computers & Operations Research
February 2012
Exact approaches to the single-source network loading problem
Networks
November 2011
Decorous Lower Bounds for Minimum Linear Arrangement
INFORMS Journal on Computing
February 2011
Statistical Confidentiality
January 2011
Generalized network design polyhedra
Networks
January 2011
The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheu...
January 2011
A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem
January 2011
Disclosure Risk and Data Utility
December 2010
Restrictions on Data Access
December 2010
Thoughts on the Future
December 2010
Concepts of Statistical Disclosure Limitation
December 2010
Protecting Tabular Data
December 2010
Assessment of Disclosure Risk
December 2010
Providing and Protecting Microdata
December 2010
Why Statistical Confidentiality?
December 2010
On the Vehicle Routing Problem with lower bound capacities
Electronic Notes in Discrete Mathematics
August 2010
Lower Bounds for the Minimum Linear Arrangement of a Graph
Electronic Notes in Discrete Mathematics
August 2010
Comments on: Routing problems with loading constraints
Top
July 2010
A local branching heuristic for the capacitated fixed-charge network design problem
Computers & Operations Research
March 2010
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Computers & Operations Research
March 2010
Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression
January 2010
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
European Journal of Operational Research
August 2009
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with ...
Networks
May 2009
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesm...
Computers & Operations Research
May 2009
Mathematical models to reconstruct phylogenetic trees under the minimum evolution crite...
Networks
March 2009
A new approach for data editing and imputation
Mathematical Methods of Operations Research
August 2008
Statistical confidentiality: Optimization techniques to protect tables
Computers & Operations Research
May 2008
A New Lower Bound for the Minimum Linear Arrangement of a Graph
Electronic Notes in Discrete Mathematics
February 2008
On the one-commodity pickup-and-delivery traveling salesman problem with stochastic dem...
Mathematical Programming
January 2008
Solving a capacitated hub location problem
European Journal of Operational Research
January 2008
The Capacitatedm-Ring-Star Problem
Operations Research
December 2007
An algorithm for checking whether the toric ideal of an affine monomial curve is a comp...
Journal of Symbolic Computation
October 2007
A branch-and-cut algorithm for the continuous error localization problem in data cleaning
Computers & Operations Research
September 2007
A heuristic approach for the continuous error localization problem in data cleaning
Computers & Operations Research
August 2007
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints
Transportation Science
May 2007
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algo...
Networks
January 2007
The Generalized Traveling Salesman and Orienteering Problems
January 2007
Solving the asymmetric traveling purchaser problem
Annals of Operations Research
April 2006
Privacy in Statistical Databases
January 2006
An Iterated Local Search Heuristic for a Capacitated Hub Location Problem
January 2006
A New Approach to Round Tabular Data
January 2006
Projection results for vehicle routing
Mathematical Programming
October 2005
Controlled rounding and cell perturbation: statistical disclosure limitation methods fo...
Mathematical Programming
October 2005
A Unified Mathematical Programming Framework for Different Statistical Disclosure Limit...
Operations Research
October 2005
Laying Out Sparse Graphs with Provably Minimum Bandwidth
INFORMS Journal on Computing
August 2005
A heuristic approach for the Travelling Purchaser Problem
European Journal of Operational Research
April 2005
The biobjective travelling purchaser problem
European Journal of Operational Research
February 2005
Locating median cycles in networks
European Journal of Operational Research
January 2005
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
Discrete Applied Mathematics
December 2004
Mathematical models for applying cell suppression methodology in statistical data prote...
European Journal of Operational Research
May 2004
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem
Transportation Science
May 2004
A branch-and-cut algorithm for the plant-cycle location problem
Journal of the Operational Research Society
April 2004
The Ring Star Problem: Polyhedral analysis and exact algorithm
Networks
March 2004
A New Tool for Applying Controlled Rounding to a Statistical Table in Microsoft Excel
January 2004
Getting the Best Results in Controlled Rounding with the Least Effort
January 2004
Decomposition Approaches for a Capacitated Hub Problem
January 2004
Exact algorithms for the job sequencing and tool switching problem
IIE Transactions
January 2004
A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
Operations Research
December 2003
Some recent contributions to routing and location problems
Networks
July 2003
The Steiner cycle polytope
European Journal of Operational Research
June 2003
Optimisation of the interconnecting network of a UMTS radio mobile telephone system
European Journal of Operational Research
January 2003
The One-Commodity Pickup-and-Delivery Travelling Salesman Problem
January 2003
Statistics and Computing
January 2003
Extending Cell Suppression to Protect Tabular Data against Several Attackers
January 2002
Solving the Cell Suppression Problem on Tabular Data with Linear Constraints
Management Science
July 2001
Models and Algorithms for Optimizing Cell Suppression in Tabular Data with Linear Const...
Journal of the American Statistical Association
September 2000
Models and Algorithms for Optimizing Cell Suppression in Tabular Data with Linear Const...
Journal of the American Statistical Association
September 2000
A note on the generalized steiner tree polytope
Discrete Applied Mathematics
March 2000
Separating lifted odd-hole inequalities to solve the index selection problem
Discrete Applied Mathematics
June 1999
Models and algorithms for the 2-dimensional cell suppression problem in statistical dis...
Mathematical Programming
February 1999
Solving the Orienteering Problem through Branch-and-Cut
INFORMS Journal on Computing
May 1998
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
Operations Research
June 1997
A branch-and-cut algorithm for a generalization of the Uncapacitated Facility Location ...
Top
June 1996
The symmetric generalized traveling salesman polytope
Networks
September 1995
Some thoughts on combinatorial optimisation
European Journal of Operational Research
June 1995