The symmetric generalized traveling salesman polytope. - Matteo Fischetti; Juan José Salazar González; Paolo Toth (Networks, 1995)

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem. - Matteo Fischetti; Juan José Salazar González; Paolo Toth (Oper. Res., 1997)

Solving the Orienteering Problem through Branch-and-Cut. - Matteo Fischetti; Juan José Salazar González; Paolo Toth (INFORMS J. Comput., 1998)

Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem. - Alberto Caprara; Juan José Salazar González (Discret. Appl. Math., 1999)

Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control. - Matteo Fischetti; Juan José Salazar (Math. Program., 1999)

A note on the generalized steiner tree polytope. - Juan José Salazar (Discret. Appl. Math., 2000)

The One-Commodity Pickup-and-Delivery Travelling Salesman Problem. - Hipólito Hernández-Pérez; Juan José Salazar González (Combinatorial Optimization, 2001)

Solving the Cell Suppression Problem on Tabular Data with Linear Constraints. - Matteo Fischetti; Juan José Salazar (Manag. Sci., 2001)

Extending Cell Suppression to Protect Tabular Data against Several Attackers. - Juan José Salazar González (Inference Control in Statistical Databases, 2002)

Optimisation of the interconnecting network of a UMTS radio mobile telephone system. - Matteo Fischetti; Giorgio Romanin-Jacur; Juan José Salazar González (Eur. J. Oper. Res., 2003)

The Steiner cycle polytope. - Juan José Salazar González (Eur. J. Oper. Res., 2003)

A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem. - Gilbert Laporte; Jorge Riera-Ledesma; Juan José Salazar González (Oper. Res., 2003)

Some recent contributions to routing and location problems. - Angel Corberán; Enrique Mota; Juan José Salazar (Networks, 2003)

Partial cell suppression: A new methodology for statistical disclosure control. - Matteo Fischetti; Juan José Salazar González (Stat. Comput., 2003)

Decomposition Approaches for a Capacitated Hub Problem. - Inmaculada Rodríguez Martín; Juan José Salazar González (IBERAMIA, 2004)

Getting the Best Results in Controlled Rounding with the Least Effort. - Juan José Salazar González; Philip Lowthian; Caroline Young; Giovanni Merola; Stephen Bond; David Brown (Privacy in Statistical Databases, 2004)

A New Tool for Applying Controlled Rounding to a Statistical Table in Microsoft Excel. - Juan José Salazar González; Markus Schoch (Privacy in Statistical Databases, 2004)

A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. - Hipólito Hernández-Pérez; Juan José Salazar González (Discret. Appl. Math., 2004)

Mathematical models for applying cell suppression methodology in statistical data protection. - Juan José Salazar González (Eur. J. Oper. Res., 2004)

A branch-and-cut algorithm for the plant-cycle location problem. - Martine Labbé; Inmaculada Rodríguez Martín; Juan José Salazar González (J. Oper. Res. Soc., 2004)

The Ring Star Problem: Polyhedral analysis and exact algorithm. - Martine Labbé; Gilbert Laporte; Inmaculada Rodríguez Martín; Juan José Salazar González (Networks, 2004)

Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem. - Hipólito Hernández-Pérez; Juan José Salazar González (Transp. Sci., 2004)

Locating median cycles in networks. - Martine Labbé; Gilbert Laporte; Inmaculada Rodríguez Martín; Juan José Salazar González (Eur. J. Oper. Res., 2005)

A heuristic approach for the Travelling Purchaser Problem. - Jorge Riera-Ledesma; Juan José Salazar González (Eur. J. Oper. Res., 2005)

The biobjective travelling purchaser problem. - Jorge Riera-Ledesma; Juan José Salazar González (Eur. J. Oper. Res., 2005)

Laying Out Sparse Graphs with Provably Minimum Bandwidth. - Alberto Caprara; Juan José Salazar González (INFORMS J. Comput., 2005)

A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods. - Juan José Salazar González (Oper. Res., 2005)

An Iterated Local Search Heuristic for a Capacitated Hub Location Problem. - Inmaculada Rodríguez Martín; Juan José Salazar González (Hybrid Metaheuristics, 2006)

A New Approach to Round Tabular Data. - Juan José Salazar González (Privacy in Statistical Databases, 2006)

Solving the asymmetric traveling purchaser problem. - Jorge Riera-Ledesma; Juan José Salazar González (Ann. Oper. Res., 2006)

Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data. - Juan José Salazar González (Math. Program., 2006)

Projection results for vehicle routing. - Adam N. Letchford; Juan José Salazar González (Math. Program., 2006)

A heuristic approach for the continuous error localization problem in data cleaning. - Jorge Riera-Ledesma; Juan José Salazar González (Comput. Oper. Res., 2007)

A branch-and-cut algorithm for the continuous error localization problem in data cleaning. - Jorge Riera-Ledesma; Juan José Salazar González (Comput. Oper. Res., 2007)

An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection. - Isabel Bermejo; Ignacio García-Marco; Juan José Salazar González (J. Symb. Comput., 2007)

The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms. - Hipólito Hernández-Pérez; Juan José Salazar González (Networks, 2007)

An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints. - Manuel Iori; Juan José Salazar González; Daniele Vigo (Transp. Sci., 2007)

Statistical confidentiality: Optimization techniques to protect tables. - Juan José Salazar González (Comput. Oper. Res., 2008)

A New Lower Bound for the Minimum Linear Arrangement of a Graph. - André Renato Sales Amaral; Alberto Caprara; Adam N. Letchford; Juan José Salazar González (Electron. Notes Discret. Math., 2008)

Solving a capacitated hub location problem. - Inmaculada Rodríguez Martín; Juan José Salazar González (Eur. J. Oper. Res., 2008)

A new approach for data editing and imputation. - Sergio Delgado-Quintero; Juan José Salazar González (Math. Methods Oper. Res., 2008)

A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. - Hipólito Hernández-Pérez; Inmaculada Rodríguez Martín; Juan José Salazar González (Comput. Oper. Res., 2009)

The multi-commodity one-to-one pickup-and-delivery traveling salesman problem. - Hipólito Hernández-Pérez; Juan José Salazar González (Eur. J. Oper. Res., 2009)

On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands. - François V. Louveaux; Juan José Salazar González (Math. Program., 2009)

Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion. - Daniele Catanzaro; Martine Labbé; Raffaele Pesenti; Juan José Salazar González (Networks, 2009)

Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression. - Juan José Salazar González (Privacy in Statistical Databases, 2010)

A local branching heuristic for the capacitated fixed-charge network design problem. - Inmaculada Rodríguez Martín; Juan José Salazar González (Comput. Oper. Res., 2010)

Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. - Verena Schmid; Karl F. Doerner; Richard F. Hartl; Juan José Salazar González (Comput. Oper. Res., 2010)

Lower Bounds for the Minimum Linear Arrangement of a Graph. - Alberto Caprara; Adam N. Letchford; Juan José Salazar González (Electron. Notes Discret. Math., 2010)

On the Vehicle Routing Problem with lower bound capacities. - Luis Eduardo Neves Gouveia; Juan José Salazar González (Electron. Notes Discret. Math., 2010)

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. - Jean-François Cordeau; Manuel Iori; Gilbert Laporte; Juan José Salazar González (Networks, 2010)

A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem. - Ivana Ljubic; Peter Putz; Juan José Salazar González (INOC, 2011)

The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic. - Inmaculada Rodríguez Martín; Juan José Salazar González (INOC, 2011)

Decorous Lower Bounds for Minimum Linear Arrangement. - Alberto Caprara; Adam N. Letchford; Juan José Salazar González (INFORMS J. Comput., 2011)

Generalized network design polyhedra. - Corinne Feremans; Martine Labbé; Adam N. Letchford; Juan José Salazar González (Networks, 2011)

Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach. - Jorge Riera-Ledesma; Juan José Salazar González (Comput. Oper. Res., 2012)

A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem. - Inmaculada Rodríguez Martín; Juan José Salazar González (J. Heuristics, 2012)

The Balanced Minimum Evolution Problem. - Daniele Catanzaro; Martine Labbé; Raffaele Pesenti; Juan José Salazar González (INFORMS J. Comput., 2012)

Exact approaches to the single-source network loading problem. - Ivana Ljubic; Peter Putz; Juan José Salazar González (Networks, 2012)

The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach. - María Batista-Galván; Jorge Riera-Ledesma; Juan José Salazar González (Comput. Oper. Res., 2013)

A column generation approach for a school bus routing problem with resource constraints. - Jorge Riera-Ledesma; Juan José Salazar González (Comput. Oper. Res., 2013)

A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem. - Valentina Cacchiani; Juan José Salazar González (Electron. Notes Discret. Math., 2013)

International Network Optimization Conference, Tenerife 2013. - Hipólito Hernández-Pérez; Jorge Riera-Ledesma; Inmaculada Rodríguez Martín; Juan José Salazar González (Electron. Notes Discret. Math., 2013)

Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. - Luis Eduardo Neves Gouveia; Jorge Riera-Ledesma; Juan José Salazar González (Networks, 2013)

Polynomial-time separation of Enhanced Reverse Multistar inequalities. - Luis Eduardo Neves Gouveia; Juan José Salazar González (Oper. Res. Lett., 2013)

Pickup-and-Delivery Problems for People Transportation. - Karl F. Doerner; Juan José Salazar González (Vehicle Routing, 2014)

On the Asymmetric Connected Facility Location Polytope. - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (ISCO, 2014)

Further Developments with Perturbation Techniques to Protect Tabular Data. - María-Salomé Hernández-García; Juan José Salazar González (Privacy in Statistical Databases, 2014)

Enhanced controlled tabular adjustment. - María-Salomé Hernández-García; Juan José Salazar González (Comput. Oper. Res., 2014)

A branch-and-cut algorithm for the hub location and routing problem. - Inmaculada Rodríguez Martín; Juan José Salazar González; Hande Yaman (Comput. Oper. Res., 2014)

Single liner shipping service design. - Christian E. M. Plum; David Pisinger; Juan José Salazar González; Mikkel Sigurd (Comput. Oper. Res., 2014)

A MIP-based approach to solve the prize-collecting local access network design problem. - Ivana Ljubic; Peter Putz; Juan José Salazar González (Eur. J. Oper. Res., 2014)

The multi-commodity pickup-and-delivery traveling salesman problem. - Hipólito Hernández-Pérez; Juan José Salazar González (Networks, 2014)

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem. - Adam N. Letchford; Juan José Salazar González (Eur. J. Oper. Res., 2015)

Preface. - Karl F. Doerner; Juan José Salazar González; Christian Stummer (Ann. Oper. Res., 2016)

A branch-and-cut algorithm for two-level survivable network design problems. - Inmaculada Rodríguez Martín; Juan José Salazar González; Hande Yaman (Comput. Oper. Res., 2016)

Hierarchical Survivable Network Design Problems. - Inmaculada Rodríguez Martín; Juan José Salazar González; Hande Yaman (Electron. Notes Discret. Math., 2016)

A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem. - Hipólito Hernández-Pérez; Inmaculada Rodríguez Martín; Juan José Salazar González (Eur. J. Oper. Res., 2016)

Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. - Adam N. Letchford; Juan José Salazar González (Eur. J. Oper. Res., 2016)

The ring/κ-rings network design problem: Model and branch-and-cut algorithm. - Inmaculada Rodríguez Martín; Juan José Salazar González; Hande Yaman (Networks, 2016)

Solving the Single Vehicle Routing Problem with Variable Capacity. - François V. Louveaux; Juan José Salazar González (Transp. Sci., 2016)

An exact algorithm for a Vehicle-and-Driver Scheduling Problem. - Bencomo Domínguez-Martín; Inmaculada Rodríguez Martín; Juan José Salazar González (Comput. Oper. Res., 2017)

An algorithmic framework for the exact solution of tree-star problems. - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (Eur. J. Oper. Res., 2017)

Solving the Team Orienteering Arc Routing Problem with a column generation approach. - Jorge Riera-Ledesma; Juan José Salazar González (Eur. J. Oper. Res., 2017)

Optimal Solutions to a Real-World Integrated Airline Scheduling Problem. - Valentina Cacchiani; Juan José Salazar González (Transp. Sci., 2017)

A Heuristic Approach to the Driver and Vehicle Routing Problem. - Bencomo Domínguez-Martín; Inmaculada Rodríguez Martín; Juan José Salazar González (ICCL, 2018)

An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem. - Hipólito Hernández-Pérez; Juan José Salazar González (ISCO, 2018)

The driver and vehicle routing problem. - Bencomo Domínguez-Martín; Inmaculada Rodríguez Martín; Juan José Salazar González (Comput. Oper. Res., 2018)

Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem. - Hipólito Hernández-Pérez; Juan José Salazar González; Beatriz Santos-Hernández (Comput. Oper. Res., 2018)

The connected facility location polytope. - Markus Leitner; Ivana Ljubic; Juan José Salazar González; Markus Sinnl (Discret. Appl. Math., 2018)

Exact Approach for the Vehicle Routing Problem with Stochastic Demands and Preventive Returns. - François V. Louveaux; Juan José Salazar González (Transp. Sci., 2018)

Optimal Solutions for the Vehicle Routing Problem with Split Demands. - Hipólito Hernández-Pérez; Juan José Salazar González (ICCL, 2019)

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm. - Tolga Bektas; Luis Gouveia 001; Antonio Martinez-Sykora; Juan José Salazar González (Eur. J. Oper. Res., 2019)

The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time. - Adam N. Letchford; Juan José Salazar González (Eur. J. Oper. Res., 2019)

The periodic vehicle routing problem with driver consistency. - Inmaculada Rodríguez Martín; Juan José Salazar González; Hande Yaman (Eur. J. Oper. Res., 2019)

The probabilistic pickup-and-delivery travelling salesman problem. - Enrique Benavent; Mercedes Landete; Juan José Salazar González; Gregorio Tirado (Expert Syst. Appl., 2019)

Selective routing problem with synchronization. - Jorge Riera-Ledesma; Juan José Salazar González (Comput. Oper. Res., 2021)

The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach. - David Wolfinger; Juan José Salazar González (Eur. J. Oper. Res., 2021)

A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints. - Alexandre M. Florio; Richard F. Hartl; Stefan Minner; Juan José Salazar González (Transp. Sci., 2021)

The Biobjective Consistent Traveling Salesman Problem. - Daniel Díaz-Ríos; Juan José Salazar González (ICCL, 2022)

Tool Switching Problems in the Context of Overlay Printing with Multiple Colours. - Manuel Iori; Alberto Locatelli; Marco Locatelli 001; Juan José Salazar González (ISCO, 2022)

A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem. - Hipólito Hernández-Pérez; Juan José Salazar González (Eur. J. Oper. Res., 2022)

An efficient multistart heuristic for the driver and vehicle routing problem. - Bencomo Domínguez-Martín; Inmaculada Rodríguez Martín; Juan José Salazar González (Comput. Oper. Res., 2023)

Tool switching problems with tool order constraints. - Manuel Iori; Alberto Locatelli; Marco Locatelli 001; Juan José Salazar González (Discret. Appl. Math., 2024)

Mathematical formulations for consistent travelling salesman problems. - Daniel Díaz-Ríos; Juan José Salazar González (Eur. J. Oper. Res., 2024)