Juan José Salazar González

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