Contact

All Stories

  1. Optimal area polygonisation problems: Mixed integer linear programming models

    Article • European Journal of Operational Research, September 2025, Elsevier

    Prof Juan José Salazar González

  2. Mathematical Formulations for Consistent Travelling Salesman Problems

    Article • European Journal of Operational Research, August 2023, Elsevier

    Prof Juan José Salazar González

  3. The Biobjective Consistent Traveling Salesman Problem

    Article • January 2022, Springer Science + Business Media

    Prof Juan José Salazar González

  4. Tool Switching Problems in the Context of Overlay Printing with Multiple Colours

    Article • January 2022, Springer Science + Business Media

    Prof Juan José Salazar González

  5. A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem

    Article • European Journal of Operational Research, May 2021, Elsevier

    Prof Juan José Salazar González

  6. Designing optimal masks for a multi-object spectrometer

    Article • Omega, January 2021, Elsevier

    Prof Juan José Salazar González

  7. A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints

    Article • Transportation Science, September 2020, INFORMS

    Prof Juan José Salazar González, Dr. Stefan Minner

  8. The probabilistic pickup-and-delivery travelling salesman problem

    Article • Expert Systems with Applications, May 2019, Elsevier

    Prof Juan José Salazar González

  9. Heuristic Approaches for Flight Retiming in an Integrated Airline Scheduling Problem of a Regional Carrier

    Article • Omega, January 2019, Elsevier

    Prof Juan José Salazar González

  10. Optimal Solutions for the Vehicle Routing Problem with Split Demands

    Article • January 2019, Springer Science + Business Media

    Prof Juan José Salazar González

  11. VRP with stochastic demands and with a restocking policy

    Article • Transportation Science, October 2018, INFORMS

    Prof Juan José Salazar González

  12. Balanced Vehicle Routing: Polyhedral Analysis and Branch-and-Cut Algorithm

    Article • European Journal of Operational Research, August 2018, Elsevier

    Prof Juan José Salazar González

  13. The Periodic Vehicle Routing Problem with Driver Consistency

    Article • European Journal of Operational Research, August 2018, Elsevier

    Prof Juan José Salazar González

  14. The Capacitated Vehicle Routing Problem: Stronger Bounds in Pseudo-Polynomial Time

    Article • European Journal of Operational Research, June 2018, Elsevier

    Prof Juan José Salazar González

  15. The driver and vehicle routing problem

    Article • Computers & Operations Research, April 2018, Elsevier

    Prof Juan José Salazar González

  16. Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem

    Article • Computers & Operations Research, April 2018, Elsevier

    Prof Juan José Salazar González

  17. A Heuristic Approach to the Driver and Vehicle Routing Problem

    Article • January 2018, Springer Science + Business Media

    Prof Juan José Salazar González

  18. An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem

    Article • January 2018, Springer Science + Business Media

    Prof Juan José Salazar González

  19. An exact algorithm for a Vehicle-and-Driver Scheduling Problem

    Article • Computers & Operations Research, May 2017, Elsevier

    Prof Juan José Salazar González

  20. Solving the Team Orienteering Arc Routing Problem with a Column Generation Approach

    Article • European Journal of Operational Research, March 2017, Elsevier

    Prof Juan José Salazar González

  21. Optimal Solutions to a Real-World Integrated Airline Scheduling Problem

    Article • Transportation Science, February 2017, INFORMS

    Prof Juan José Salazar González

  22. An Algorithmic Framework for the Exact Solution of Tree-Star Problems

    Article • European Journal of Operational Research, February 2017, Elsevier

    Prof Juan José Salazar González

  23. The connected facility location polytope

    Article • Discrete Applied Mathematics, September 2016, Elsevier

    Prof Juan José Salazar González

  24. The ring/κ-rings network design problem: Model and branch-and-cut algorithm

    Article • Networks, June 2016, Wiley

    Prof Juan José Salazar González

  25. Hierarchical Survivable Network Design Problems

    Article • Electronic Notes in Discrete Mathematics, June 2016, Elsevier

    Prof Juan José Salazar González

  26. Solving the Single Vehicle Routing Problem with Variable Capacity

    Article • Transportation Science, May 2016, INFORMS

    Prof Juan José Salazar González

  27. Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem

    Article • European Journal of Operational Research, May 2016, Elsevier

    Prof Juan José Salazar González

  28. A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem

    Article • European Journal of Operational Research, May 2016, Elsevier

    Prof Juan José Salazar González

  29. A branch-and-cut algorithm for two-level survivable network design problems

    Article • Computers & Operations Research, March 2016, Elsevier

    Prof Juan José Salazar González

  30. Preface

    Article • Annals of Operations Research, November 2015, Springer Science + Business Media

    Prof Juan José Salazar González

  31. Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem

    Article • European Journal of Operational Research, August 2015, Elsevier

    Prof Juan José Salazar González

  32. Preface

    Article • Networks, May 2015, Wiley

    Prof Juan José Salazar González

  33. Container stacking revenue management system: A fuzzy-based strategy for Valparaiso port

    Article • DYNA, May 2015, Universidad Nacional de Colombia

    Prof Juan José Salazar González

  34. The split-demand one-commodity pickup-and-delivery travelling salesman problem

    Article • Transportation Research Part B Methodological, May 2015, Elsevier

    Prof Juan José Salazar González

  35. Chapter 7: Pickup-and-Delivery Problems for People Transportation

    Article • November 2014, Society for Industrial & Applied Mathematics (SIAM)

    Prof Juan José Salazar González

  36. A branch-and-cut algorithm for the hub location and routing problem

    Article • Computers & Operations Research, October 2014, Elsevier

    Prof Juan José Salazar González

  37. A MIP-based approach to solve the prize-collecting local access network design problem

    Article • European Journal of Operational Research, June 2014, Elsevier

    Prof Juan José Salazar González

  38. Single liner shipping service design

    Article • Computers & Operations Research, May 2014, Elsevier

    Prof Juan José Salazar González

  39. Enhanced controlled tabular adjustment

    Article • Computers & Operations Research, March 2014, Elsevier

    Prof Juan José Salazar González

  40. Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier

    Article • Omega, March 2014, Elsevier

    Prof Juan José Salazar González

  41. Measuring cost efficiency in the presence of quasi-fixed inputs using dynamic Data Envelopment Analysis: The case of port infrastructure

    Article • Maritime Economics & Logistics, January 2014, Springer Science + Business Media

    Prof Juan José Salazar González

  42. On the Asymmetric Connected Facility Location Polytope

    Article • January 2014, Springer Science + Business Media

    Prof Juan José Salazar González

  43. On the Asymmetric Connected Facility Location Polytope

    Article • January 2014, Springer Science + Business Media

    Prof Juan José Salazar González

  44. Further Developments with Perturbation Techniques to Protect Tabular Data

    Article • January 2014, Springer Science + Business Media

    Prof Juan José Salazar González

  45. The multi‐commodity pickup‐and‐delivery traveling salesman problem

    Article • Networks, October 2013, Wiley

    Prof Juan José Salazar González

  46. The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach

    Article • Computers & Operations Research, August 2013, Elsevier

    Prof Juan José Salazar González

  47. A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem

    Article • Electronic Notes in Discrete Mathematics, June 2013, Elsevier

    Prof Juan José Salazar González

  48. International Network Optimization Conference, Tenerife 2013

    Article • Electronic Notes in Discrete Mathematics, June 2013, Elsevier

    Prof Juan José Salazar González

  49. Polynomial-time separation of Enhanced Reverse Multistar inequalities

    Article • Operations Research Letters, May 2013, Elsevier

    Prof Juan José Salazar González

  50. A column generation approach for a school bus routing problem with resource constraints

    Article • Computers & Operations Research, February 2013, Elsevier

    Prof Juan José Salazar González

  51. Statistical Confidentiality: Principles and Practice by George T. Duncan, Mark Elliot, Juan-José Salazar-González

    Article • International Statistical Review, November 2012, Wiley

    Prof Juan José Salazar González

  52. A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem

    Article • Journal of Heuristics, September 2012, Springer Science + Business Media

    Prof Juan José Salazar González

  53. Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route

    Article • Networks, August 2012, Wiley

    Prof Juan José Salazar González

  54. The Balanced Minimum Evolution Problem

    Article • INFORMS Journal on Computing, May 2012, INFORMS

    Prof Juan José Salazar González

  55. Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach

    Article • Computers & Operations Research, February 2012, Elsevier

    Prof Juan José Salazar González

  56. Exact approaches to the single-source network loading problem

    Article • Networks, November 2011, Wiley

    Prof Juan José Salazar González

  57. Generalized network design polyhedra

    Article • Networks, August 2011, Wiley

    Prof Juan José Salazar González

  58. Decorous Lower Bounds for Minimum Linear Arrangement

    Article • INFORMS Journal on Computing, February 2011, INFORMS

    Prof Juan José Salazar González

  59. Statistical Confidentiality

    Article • January 2011, Springer Science + Business Media

    Prof Juan José Salazar González

  60. The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic

    Article • January 2011, Springer Science + Business Media

    Prof Juan José Salazar González

  61. A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem

    Article • January 2011, Springer Science + Business Media

    Prof Juan José Salazar González

  62. Disclosure Risk and Data Utility

    Article • December 2010, Springer Science + Business Media

    Prof Juan José Salazar González

  63. Restrictions on Data Access

    Article • December 2010, Springer Science + Business Media

    Prof Juan José Salazar González

  64. Thoughts on the Future

    Article • December 2010, Springer Science + Business Media

    Prof Juan José Salazar González

  65. Concepts of Statistical Disclosure Limitation

    Article • December 2010, Springer Science + Business Media

    Prof Juan José Salazar González

  66. Protecting Tabular Data

    Article • December 2010, Springer Science + Business Media

    Prof Juan José Salazar González

  67. Assessment of Disclosure Risk

    Article • December 2010, Springer Science + Business Media

    Prof Juan José Salazar González

  68. Providing and Protecting Microdata

    Article • December 2010, Springer Science + Business Media

    Prof Juan José Salazar González

  69. Why Statistical Confidentiality?

    Article • December 2010, Springer Science + Business Media

    Prof Juan José Salazar González

  70. On the Vehicle Routing Problem with lower bound capacities

    Article • Electronic Notes in Discrete Mathematics, August 2010, Elsevier

    Prof Juan José Salazar González

  71. Lower Bounds for the Minimum Linear Arrangement of a Graph

    Article • Electronic Notes in Discrete Mathematics, August 2010, Elsevier

    Prof Juan José Salazar González

  72. Comments on: Routing problems with loading constraints

    Article • Top, July 2010, Springer Science + Business Media

    Prof Juan José Salazar González

  73. Comments on: Routing problems with loading constraints

    Article • Top, July 2010, Springer Science + Business Media

    Prof Juan José Salazar González

  74. A local branching heuristic for the capacitated fixed-charge network design problem

    Article • Computers & Operations Research, March 2010, Elsevier

    Prof Juan José Salazar González

  75. Hybridization of very large neighborhood search for ready-mixed concrete delivery problems

    Article • Computers & Operations Research, March 2010, Elsevier

    Prof Juan José Salazar González

  76. Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression

    Article • January 2010, Springer Science + Business Media

    Prof Juan José Salazar González

  77. The multi-commodity one-to-one pickup-and-delivery traveling salesman problem

    Article • European Journal of Operational Research, August 2009, Elsevier

    Prof Juan José Salazar González

  78. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

    Article • Networks, May 2009, Wiley

    Prof Juan José Salazar González

  79. A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem

    Article • Computers & Operations Research, May 2009, Elsevier

    Prof Juan José Salazar González

  80. Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion

    Article • Networks, October 2008, Wiley

    Prof Juan José Salazar González

  81. A new approach for data editing and imputation

    Article • Mathematical Methods of Operations Research, August 2008, Springer Science + Business Media

    Prof Juan José Salazar González

  82. Statistical confidentiality: Optimization techniques to protect tables

    Article • Computers & Operations Research, May 2008, Elsevier

    Prof Juan José Salazar González

  83. A New Lower Bound for the Minimum Linear Arrangement of a Graph

    Article • Electronic Notes in Discrete Mathematics, February 2008, Elsevier

    Prof Juan José Salazar González

  84. On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands

    Article • Mathematical Programming, January 2008, Springer Science + Business Media

    Prof Juan José Salazar González

  85. Solving a capacitated hub location problem

    Article • European Journal of Operational Research, January 2008, Elsevier

    Prof Juan José Salazar González

  86. The Capacitatedm-Ring-Star Problem

    Article • Operations Research, December 2007, INFORMS

    Prof Juan José Salazar González

  87. An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection

    Article • Journal of Symbolic Computation, October 2007, Elsevier

    Prof Juan José Salazar González

  88. A branch-and-cut algorithm for the continuous error localization problem in data cleaning

    Article • Computers & Operations Research, September 2007, Elsevier

    Prof Juan José Salazar González

  89. A heuristic approach for the continuous error localization problem in data cleaning

    Article • Computers & Operations Research, August 2007, Elsevier

    Prof Juan José Salazar González

  90. An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

    Article • Transportation Science, May 2007, INFORMS

    Prof Juan José Salazar González, Prof. Daniele Vigo

  91. The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms

    Article • Networks, January 2007, Wiley

    Prof Juan José Salazar González

  92. The Generalized Traveling Salesman and Orienteering Problems

    Article • January 2007, Springer Science + Business Media

    Prof Juan José Salazar González

  93. Solving the asymmetric traveling purchaser problem

    Article • Annals of Operations Research, April 2006, Springer Science + Business Media

    Prof Juan José Salazar González

  94. Privacy in Statistical Databases

    Article • January 2006

    Prof Juan José Salazar González

  95. An Iterated Local Search Heuristic for a Capacitated Hub Location Problem

    Article • January 2006, Springer Science + Business Media

    Prof Juan José Salazar González

  96. A New Approach to Round Tabular Data

    Article • January 2006, Springer Science + Business Media

    Prof Juan José Salazar González

  97. Projection results for vehicle routing

    Article • Mathematical Programming, October 2005, Springer Science + Business Media

    Prof Juan José Salazar González

  98. Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data

    Article • Mathematical Programming, October 2005, Springer Science + Business Media

    Prof Juan José Salazar González

  99. A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods

    Article • Operations Research, October 2005, INFORMS

    Prof Juan José Salazar González

  100. Laying Out Sparse Graphs with Provably Minimum Bandwidth

    Article • INFORMS Journal on Computing, August 2005, INFORMS

    Prof Juan José Salazar González

  101. A heuristic approach for the Travelling Purchaser Problem

    Article • European Journal of Operational Research, April 2005, Elsevier

    Prof Juan José Salazar González

  102. The biobjective travelling purchaser problem

    Article • European Journal of Operational Research, February 2005, Elsevier

    Prof Juan José Salazar González

  103. Locating median cycles in networks

    Article • European Journal of Operational Research, January 2005, Elsevier

    Prof Juan José Salazar González

  104. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

    Article • Discrete Applied Mathematics, December 2004, Elsevier

    Prof Juan José Salazar González

  105. Mathematical models for applying cell suppression methodology in statistical data protection

    Article • European Journal of Operational Research, May 2004, Elsevier

    Prof Juan José Salazar González

  106. Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem

    Article • Transportation Science, May 2004, INFORMS

    Prof Juan José Salazar González

  107. A branch-and-cut algorithm for the plant-cycle location problem

    Article • Journal of the Operational Research Society, April 2004, Nature

    Prof Juan José Salazar González

  108. The Ring Star Problem: Polyhedral analysis and exact algorithm

    Article • Networks, March 2004, Wiley

    Prof Juan José Salazar González

  109. A New Tool for Applying Controlled Rounding to a Statistical Table in Microsoft Excel

    Article • January 2004, Springer Science + Business Media

    Prof Juan José Salazar González

  110. Getting the Best Results in Controlled Rounding with the Least Effort

    Article • January 2004, Springer Science + Business Media

    Prof Juan José Salazar González

  111. Decomposition Approaches for a Capacitated Hub Problem

    Article • January 2004, Springer Science + Business Media

    Prof Juan José Salazar González

  112. Exact algorithms for the job sequencing and tool switching problem

    Article • IIE Transactions, January 2004, Taylor & Francis

    Prof Juan José Salazar González

  113. A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem

    Article • Operations Research, December 2003, INFORMS

    Prof Juan José Salazar González

  114. Some recent contributions to routing and location problems

    Article • Networks, July 2003, Wiley

    Prof Juan José Salazar González

  115. The Steiner cycle polytope

    Article • European Journal of Operational Research, June 2003, Elsevier

    Prof Juan José Salazar González

  116. Optimisation of the interconnecting network of a UMTS radio mobile telephone system

    Article • European Journal of Operational Research, January 2003, Elsevier

    Prof Juan José Salazar González

  117. The One-Commodity Pickup-and-Delivery Travelling Salesman Problem

    Article • January 2003, Springer Science + Business Media

    Prof Juan José Salazar González

  118. Article • Statistics and Computing, January 2003, Springer Science + Business Media

    Prof Juan José Salazar González

  119. Extending Cell Suppression to Protect Tabular Data against Several Attackers

    Article • January 2002, Springer Science + Business Media

    Prof Juan José Salazar González

  120. Solving the Cell Suppression Problem on Tabular Data with Linear Constraints

    Article • Management Science, July 2001, INFORMS

    Prof Juan José Salazar González

  121. Models and Algorithms for Optimizing Cell Suppression in Tabular Data with Linear Constraints

    Article • Journal of the American Statistical Association, September 2000, Taylor & Francis

    Prof Juan José Salazar González

  122. Models and Algorithms for Optimizing Cell Suppression in Tabular Data with Linear Constraints

    Article • Journal of the American Statistical Association, September 2000, JSTOR

    Prof Juan José Salazar González

  123. A note on the generalized steiner tree polytope

    Article • Discrete Applied Mathematics, March 2000, Elsevier

    Prof Juan José Salazar González

  124. Separating lifted odd-hole inequalities to solve the index selection problem

    Article • Discrete Applied Mathematics, June 1999, Elsevier

    Prof Juan José Salazar González

  125. Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control

    Article • Mathematical Programming, February 1999, Springer Science + Business Media

    Prof Juan José Salazar González

  126. Solving the Orienteering Problem through Branch-and-Cut

    Article • INFORMS Journal on Computing, May 1998, INFORMS

    Prof Juan José Salazar González

  127. A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

    Article • Operations Research, June 1997, INFORMS

    Prof Juan José Salazar González

  128. A branch-and-cut algorithm for a generalization of the Uncapacitated Facility Location Problem

    Article • Top, June 1996, Springer Science + Business Media

    Prof Juan José Salazar González

  129. The symmetric generalized traveling salesman polytope

    Article • Networks, September 1995, Wiley

    Prof Juan José Salazar González

  130. Some thoughts on combinatorial optimisation

    Article • European Journal of Operational Research, June 1995, Elsevier

    Prof Juan José Salazar González