Juan José Salazar González

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 31

Top Venues

Publications

Daniel Díaz-Ríos, Juan José Salazar González
Mathematical formulations for consistent travelling salesman problems. Eur. J. Oper. Res. 313 (2) (2024)
Manuel Iori, Alberto Locatelli, Marco Locatelli, Juan José Salazar González
Tool switching problems with tool order constraints. Discret. Appl. Math. 347 (2024)
Bencomo Domínguez-Martín, Inmaculada Rodríguez Martín, Juan José Salazar González
An efficient multistart heuristic for the driver and vehicle routing problem. Comput. Oper. Res. 150 (2023)
Daniel Díaz-Ríos, Juan José Salazar González
The Biobjective Consistent Traveling Salesman Problem. ICCL (2022)
Hipólito Hernández-Pérez, Juan José Salazar González
A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 297 (2) (2022)
Manuel Iori, Alberto Locatelli, Marco Locatelli, Juan José Salazar González
Tool Switching Problems in the Context of Overlay Printing with Multiple Colours. ISCO (2022)
Jorge Riera-Ledesma, Juan José Salazar González
Selective routing problem with synchronization. Comput. Oper. Res. 135 (2021)
Alexandre M. Florio, Richard F. Hartl, Stefan Minner, Juan José Salazar González
A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints. Transp. Sci. 55 (1) (2021)
David Wolfinger, Juan José Salazar González
The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach. Eur. J. Oper. Res. 289 (2) (2021)
Tolga Bektas, Luis Eduardo Neves Gouveia, Antonio Martinez-Sykora, Juan José Salazar González
Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm. Eur. J. Oper. Res. 273 (2) (2019)
Adam N. Letchford, Juan José Salazar González
The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time. Eur. J. Oper. Res. 272 (1) (2019)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
The periodic vehicle routing problem with driver consistency. Eur. J. Oper. Res. 273 (2) (2019)
Hipólito Hernández-Pérez, Juan José Salazar González
Optimal Solutions for the Vehicle Routing Problem with Split Demands. ICCL (2019)
Enrique Benavent, Mercedes Landete, Juan José Salazar González, Gregorio Tirado
The probabilistic pickup-and-delivery travelling salesman problem. Expert Syst. Appl. 121 (2019)
Hipólito Hernández-Pérez, Juan José Salazar González, Beatriz Santos-Hernández
Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem. Comput. Oper. Res. 97 (2018)
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
The connected facility location polytope. Discret. Appl. Math. 234 (2018)
Bencomo Domínguez-Martín, Inmaculada Rodríguez Martín, Juan José Salazar González
A Heuristic Approach to the Driver and Vehicle Routing Problem. ICCL (2018)
Hipólito Hernández-Pérez, Juan José Salazar González
An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem. ISCO (2018)
Bencomo Domínguez-Martín, Inmaculada Rodríguez Martín, Juan José Salazar González
The driver and vehicle routing problem. Comput. Oper. Res. 92 (2018)
François V. Louveaux, Juan José Salazar González
Exact Approach for the Vehicle Routing Problem with Stochastic Demands and Preventive Returns. Transp. Sci. 52 (6) (2018)
Bencomo Domínguez-Martín, Inmaculada Rodríguez Martín, Juan José Salazar González
An exact algorithm for a Vehicle-and-Driver Scheduling Problem. Comput. Oper. Res. 81 (2017)
Valentina Cacchiani, Juan José Salazar González
Optimal Solutions to a Real-World Integrated Airline Scheduling Problem. Transp. Sci. 51 (1) (2017)
Jorge Riera-Ledesma, Juan José Salazar González
Solving the Team Orienteering Arc Routing Problem with a column generation approach. Eur. J. Oper. Res. 262 (1) (2017)
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
An algorithmic framework for the exact solution of tree-star problems. Eur. J. Oper. Res. 261 (1) (2017)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
-rings network design problem: Model and branch-and-cut algorithm. Networks 68 (2) (2016)
Hipólito Hernández-Pérez, Inmaculada Rodríguez Martín, Juan José Salazar González
A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem. Eur. J. Oper. Res. 251 (1) (2016)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
Hierarchical Survivable Network Design Problems. Electron. Notes Discret. Math. 52 (2016)
Adam N. Letchford, Juan José Salazar González
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. Eur. J. Oper. Res. 251 (1) (2016)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
A branch-and-cut algorithm for two-level survivable network design problems. Comput. Oper. Res. 67 (2016)
Karl F. Doerner, Juan José Salazar González, Christian Stummer
Preface. Ann. Oper. Res. 236 (2) (2016)
François V. Louveaux, Juan José Salazar González
Solving the Single Vehicle Routing Problem with Variable Capacity. Transp. Sci. 50 (2) (2016)
Adam N. Letchford, Juan José Salazar González
Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem. Eur. J. Oper. Res. 244 (3) (2015)
Ivana Ljubic, Peter Putz, Juan José Salazar González
A MIP-based approach to solve the prize-collecting local access network design problem. Eur. J. Oper. Res. 235 (3) (2014)
Christian E. M. Plum, David Pisinger, Juan José Salazar González, Mikkel Sigurd
Single liner shipping service design. Comput. Oper. Res. 45 (2014)
María-Salomé Hernández-García, Juan José Salazar González
Enhanced controlled tabular adjustment. Comput. Oper. Res. 43 (2014)
María-Salomé Hernández-García, Juan José Salazar González
Further Developments with Perturbation Techniques to Protect Tabular Data. Privacy in Statistical Databases (2014)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
A branch-and-cut algorithm for the hub location and routing problem. Comput. Oper. Res. 50 (2014)
Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl
On the Asymmetric Connected Facility Location Polytope. ISCO (2014)
Hipólito Hernández-Pérez, Juan José Salazar González
The multi-commodity pickup-and-delivery traveling salesman problem. Networks 63 (1) (2014)
Valentina Cacchiani, Juan José Salazar González
A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem. Electron. Notes Discret. Math. 41 (2013)
Luis Eduardo Neves Gouveia, Juan José Salazar González
Polynomial-time separation of Enhanced Reverse Multistar inequalities. Oper. Res. Lett. 41 (3) (2013)
María Batista-Galván, Jorge Riera-Ledesma, Juan José Salazar González
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach. Comput. Oper. Res. 40 (8) (2013)
Hipólito Hernández-Pérez, Jorge Riera-Ledesma, Inmaculada Rodríguez Martín, Juan José Salazar González
International Network Optimization Conference, Tenerife 2013. Electron. Notes Discret. Math. 41 (2013)
Luis Eduardo Neves Gouveia, Jorge Riera-Ledesma, Juan José Salazar González
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. Networks 61 (4) (2013)
Jorge Riera-Ledesma, Juan José Salazar González
A column generation approach for a school bus routing problem with resource constraints. Comput. Oper. Res. 40 (2) (2013)
Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González
The Balanced Minimum Evolution Problem. INFORMS J. Comput. 24 (2) (2012)
Jorge Riera-Ledesma, Juan José Salazar González
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach. Comput. Oper. Res. 39 (2) (2012)
Inmaculada Rodríguez Martín, Juan José Salazar González
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem. J. Heuristics 18 (6) (2012)
Ivana Ljubic, Peter Putz, Juan José Salazar González
Exact approaches to the single-source network loading problem. Networks 59 (1) (2012)
Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González
Generalized network design polyhedra. Networks 58 (2) (2011)
Alberto Caprara, Adam N. Letchford, Juan José Salazar González
Decorous Lower Bounds for Minimum Linear Arrangement. INFORMS J. Comput. 23 (1) (2011)
Ivana Ljubic, Peter Putz, Juan José Salazar González
A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem. INOC (2011)
Inmaculada Rodríguez Martín, Juan José Salazar González
The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic. INOC (2011)
Juan José Salazar González
Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression. Privacy in Statistical Databases (2010)
Verena Schmid, Karl F. Doerner, Richard F. Hartl, Juan José Salazar González
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Comput. Oper. Res. 37 (3) (2010)
Inmaculada Rodríguez Martín, Juan José Salazar González
A local branching heuristic for the capacitated fixed-charge network design problem. Comput. Oper. Res. 37 (3) (2010)
Alberto Caprara, Adam N. Letchford, Juan José Salazar González
Lower Bounds for the Minimum Linear Arrangement of a Graph. Electron. Notes Discret. Math. 36 (2010)
Luis Eduardo Neves Gouveia, Juan José Salazar González
On the Vehicle Routing Problem with lower bound capacities. Electron. Notes Discret. Math. 36 (2010)
Jean-François Cordeau, Manuel Iori, Gilbert Laporte, Juan José Salazar González
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55 (1) (2010)
Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González
Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion. Networks 53 (2) (2009)
François V. Louveaux, Juan José Salazar González
On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands. Math. Program. 119 (1) (2009)
Hipólito Hernández-Pérez, Inmaculada Rodríguez Martín, Juan José Salazar González
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Comput. Oper. Res. 36 (5) (2009)
Hipólito Hernández-Pérez, Juan José Salazar González
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem. Eur. J. Oper. Res. 196 (3) (2009)
André Renato Sales Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González
A New Lower Bound for the Minimum Linear Arrangement of a Graph. Electron. Notes Discret. Math. 30 (2008)
Sergio Delgado-Quintero, Juan José Salazar González
A new approach for data editing and imputation. Math. Methods Oper. Res. 68 (3) (2008)
Juan José Salazar González
Statistical confidentiality: Optimization techniques to protect tables. Comput. Oper. Res. 35 (5) (2008)
Inmaculada Rodríguez Martín, Juan José Salazar González
Solving a capacitated hub location problem. Eur. J. Oper. Res. 184 (2) (2008)
Jorge Riera-Ledesma, Juan José Salazar González
A branch-and-cut algorithm for the continuous error localization problem in data cleaning. Comput. Oper. Res. 34 (9) (2007)
Manuel Iori, Juan José Salazar González, Daniele Vigo
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints. Transp. Sci. 41 (2) (2007)
Isabel Bermejo, Ignacio García-Marco, Juan José Salazar González
An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection. J. Symb. Comput. 42 (10) (2007)
Jorge Riera-Ledesma, Juan José Salazar González
A heuristic approach for the continuous error localization problem in data cleaning. Comput. Oper. Res. 34 (8) (2007)
Hipólito Hernández-Pérez, Juan José Salazar González
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms. Networks 50 (4) (2007)
Adam N. Letchford, Juan José Salazar González
Projection results for vehicle routing. Math. Program. 105 (2-3) (2006)
Juan José Salazar González
Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data. Math. Program. 105 (2-3) (2006)
Jorge Riera-Ledesma, Juan José Salazar González
Solving the asymmetric traveling purchaser problem. Ann. Oper. Res. 144 (1) (2006)
Juan José Salazar González
A New Approach to Round Tabular Data. Privacy in Statistical Databases (2006)
Inmaculada Rodríguez Martín, Juan José Salazar González
An Iterated Local Search Heuristic for a Capacitated Hub Location Problem. Hybrid Metaheuristics (2006)
Jorge Riera-Ledesma, Juan José Salazar González
The biobjective travelling purchaser problem. Eur. J. Oper. Res. 160 (3) (2005)
Juan José Salazar González
A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods. Oper. Res. 53 (5) (2005)
Alberto Caprara, Juan José Salazar González
Laying Out Sparse Graphs with Provably Minimum Bandwidth. INFORMS J. Comput. 17 (3) (2005)
Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González
Locating median cycles in networks. Eur. J. Oper. Res. 160 (2) (2005)
Jorge Riera-Ledesma, Juan José Salazar González
A heuristic approach for the Travelling Purchaser Problem. Eur. J. Oper. Res. 162 (1) (2005)
Martine Labbé, Inmaculada Rodríguez Martín, Juan José Salazar González
A branch-and-cut algorithm for the plant-cycle location problem. J. Oper. Res. Soc. 55 (5) (2004)
Juan José Salazar González, Markus Schoch
A New Tool for Applying Controlled Rounding to a Statistical Table in Microsoft Excel. Privacy in Statistical Databases (2004)
Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González
The Ring Star Problem: Polyhedral analysis and exact algorithm. Networks 43 (3) (2004)
Juan José Salazar González, Philip Lowthian, Caroline Young, Giovanni Merola, Stephen Bond, David Brown
Getting the Best Results in Controlled Rounding with the Least Effort. Privacy in Statistical Databases (2004)
Inmaculada Rodríguez Martín, Juan José Salazar González
Decomposition Approaches for a Capacitated Hub Problem. IBERAMIA (2004)
Hipólito Hernández-Pérez, Juan José Salazar González
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discret. Appl. Math. 145 (1) (2004)
Hipólito Hernández-Pérez, Juan José Salazar González
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem. Transp. Sci. 38 (2) (2004)
Juan José Salazar González
Mathematical models for applying cell suppression methodology in statistical data protection. Eur. J. Oper. Res. 154 (3) (2004)
Matteo Fischetti, Giorgio Romanin-Jacur, Juan José Salazar González
Optimisation of the interconnecting network of a UMTS radio mobile telephone system. Eur. J. Oper. Res. 144 (1) (2003)
Juan José Salazar González
The Steiner cycle polytope. Eur. J. Oper. Res. 147 (3) (2003)
Gilbert Laporte, Jorge Riera-Ledesma, Juan José Salazar González
A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem. Oper. Res. 51 (6) (2003)
Matteo Fischetti, Juan José Salazar González
Partial cell suppression: A new methodology for statistical disclosure control. Stat. Comput. 13 (1) (2003)
Juan José Salazar González
Extending Cell Suppression to Protect Tabular Data against Several Attackers. Inference Control in Statistical Databases (2002)
Hipólito Hernández-Pérez, Juan José Salazar González
The One-Commodity Pickup-and-Delivery Travelling Salesman Problem. Combinatorial Optimization (2001)
Alberto Caprara, Juan José Salazar González
Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem. Discret. Appl. Math. 92 (2-3) (1999)
Matteo Fischetti, Juan José Salazar González, Paolo Toth
Solving the Orienteering Problem through Branch-and-Cut. INFORMS J. Comput. 10 (2) (1998)
Matteo Fischetti, Juan José Salazar González, Paolo Toth
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem. Oper. Res. 45 (3) (1997)
Matteo Fischetti, Juan José Salazar González, Paolo Toth
The symmetric generalized traveling salesman polytope. Networks 26 (2) (1995)

Juan José Salazar González.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Juan José Salazar González