Juan José Salazar González

My short CV in different databases:
Google Scholar:  http://scholar.google.es/citations?user=pd7y0AcAAAAJ&hl=en&oi=ao
Scopys:             http://www.scopus.com/authid/detail.url?authorId=7003911626 
Resarch Gate:    http://www.researchgate.net/profile/Juan_Jose_Salazar_Gonzalez/
Orcid:               http://orcid.org/0000-0001-5683-0271
Research id:      http://www.researcherid.com/rid/C-3671-2014
AMS:                http://www.ams.org/mathscinet/search/author.html?mrauthid=366757
ACM:                http://dl.acm.org/author_page.cfm?id=81100597603
Microsoft Acad.: https://academic.microsoft.com/#/detail/2170108961
Kudos:              https://www.growkudos.com/profiles/8642
Mendeley:         https://www.mendeley.com/profiles/juan-jose-salazar-gonzalez2/

Social networks:   facebook  twitter  Linkedin  Google Plus  tuenti  instagram  Skype

Editor-in-Chief of the international scientific journal TOP  

Associate Editor of OMEGA  , INFOR , C&OR , EJCO , JPC

Leader at ULL of a research group working in Logistics and Optimization: GOMA

Leader at ULL of the Spanish-funded research projects: TIC2000-1750-C06-02, TIC2002-00895, TIC2003-05982-C05-02, MTM2006-14961-C05-03, MTM2009-14039-C06-01, MTM2012-36163-C06-01, MTM2015-63680-R

Leader at ULL of the EU-funded research projects: IST-2000-25069, INFRA-2010-1.1.3 (Grant 262608)

Member of “Instituto Universitario de Desarrollo Regional” and “Centro de Investigación Matemática de Canarias”.

Work address:        Departamento de Matemáticas, Estadística e Investigación Operativa

                             Sección de Matemáticas - Facultad de Ciencias - Universidad de La Laguna

                             Av. Astrofísico Francisco Sánchez, s/n  ;  38200 La Laguna, Tenerife, Spain

Telephone: +34 922 318184  ;   Email:   jjsalaza@ull.es

Title:    Degree in Mathematics, University of La Laguna, July 1989   

           PhD in Mathematics, University of Bologna, July 1992           

           PhD in Informatics, University of La Laguna, April 1996            

Position:        Assistant Professor at University of La Laguna from December 1989 to August 1997

                    Associated Professor at University of La Laguna from August 1997 to December 2006

                    Full Professor at University of La Laguna from December 2006 to today.

                         ( 3 sexenios de investigación reconocidos por el ministerio )

 

Author of text books:                                Co-author of books:                       Author of chapters in:

 Programación Matemática   Lecciones de Optimización                                    Statistical Disclosure Control   Ejercicios Resueltos de Probabilidad                             Travelling Salesman Problem   Vehicle Routing Problem

 Some of my other publications:

[96]  Rodríguez-Martín, I., Salazar-González, J.-J., Yaman, H. “The ring/κ-rings network design problem: Model and branch-and-cut algorithm” (2016) Networks, 68 (2), pp. 130-140.

[95]  Rodríguez-Martín, I., Salazar-González, J.-J., Yaman, H. “Hierarchical Survivable Network Design Problems” (2016) Electronic Notes in Discrete Mathematics, 52, pp. 229-236.

[94]  Letchford, A.N., Salazar-González, J.-J. “Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem” (2016) European Journal of Operational Research, 251 (1), pp. 74-84.

[93]  Hernández-Pérez, H., Rodríguez-Martín, I., Salazar-González, J.-J. “A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem” (2016) European Journal of Operational Research, 251 (1), pp. 44-52.

[92]  Louveaux, F.V., Salazar-González, J.-J. “Solving the single vehicle routing problem with variable capacity” (2016) Transportation Science, 50 (2), pp. 708-719.

[91]  Rodríguez-Martín, I., Salazar-González, J.-J., Yaman, H. “A branch-and-cut algorithm for two-level survivable network design problems” (2016) Computers and Operations Research, 67, pp. 102-112.

[90]  Doerner, K.F., Salazar-González, J.-J., Stummer, C. “Preface” (2016) Annals of Operations Research, 236 (2), pp. 291-293.

[89]  Leitner, M., Ljubic, I., Salazar-González, J.-J., Sinnl, M. “The connected facility location polytope” (2015) Discrete Applied Mathematics, . Article in Press.

[88]  Salazar-González, J.-J., Santos-Hernández, B. “The split-demand one-commodity pickup-and-delivery travelling salesman problem” (2015) Transportation Research Part B: Methodological, 75, pp. 58-73.

[87]  Gouveia, L., Salazar-González, J.-J. “Preface” (2015) Networks, 65 (4), pp. 287-288.

[86]  Letchford, A.N., Salazar-González, J.-J. “Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem” (2015) European Journal of Operational Research, 244 (3), art. no. 12797, pp. 730-738.

[85]  Ljubic, I., Putz, P., Salazar-González, J.-J. “A MIP-based approach to solve the prize-collecting local access network design problem” (2014) European Journal of Operational Research, 235 (3), pp. 727-739.

[84]  Plum, C.E.M., Pisinger, D., Salazar-González, J.-J., Sigurd, M.M. “Single liner shipping service design” (2014) Computers and Operations Research, 45, pp. 1-6.

[83]  Salazar-González, J.-J. “Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier” (2014) Omega (United Kingdom), 43, pp. 71-82.

[82]  Hernández-García, M.-S., Salazar-González, J.-J. “Enhanced controlled tabular adjustment” (2014) Computers and Operations Research, 43 (1), pp. 61-67.

[81]  Hernández-Pérez, H., Salazar-González, J.-J. “The multi-commodity pickup-and-delivery traveling salesman problem” (2014) Networks, 63 (1), pp. 46-59.

[80]  Hernández-García, M.-S., Salazar-González, J.-J. “Further developments with perturbation techniques to protect tabular data” (2014) Lecture Notes in Computer Science, 8744, pp. 24-35.

[79]  Díaz-Hernández, J.J., Martínez-Budría, E., Salazar-González, J.J. “Measuring cost efficiency in the presence of quasi-fixed inputs using dynamic data envelopment analysis: The case of port infrastructure” (2014) Maritime Economics and Logistics, 16 (2), pp. 111-126.

[78]  Rodríguez-Martín, I., Salazar-González, J.-J., Yaman, H. “A branch-and-cut algorithm for the hub location and routing problem” (2014) Computers and Operations Research, 50, pp. 161-174.

[77]  Leitner, M., Ljubic, I., Salazar-González, J.-J., Sinnl, M. “On the asymmetric connected facility location polytope” (2014) Lecture Notes in Computer Science, 8596 LNCS, pp. 371-383.

[76]  Batista-Galván, M., Riera-Ledesma, J., Salazar-González, J.J. “The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach” (2013) Computers and Operations Research, 40 (8), pp. 2103-2115.

[75]  Cacchiani, V., Salazar-González, J.-J. “A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem” (2013) Electronic Notes in Discrete Mathematics, 41, pp. 391-398.

[74]  Hernández-Pérez, H., Riera-Ledesma, J., Rodríguez-Martín, I., Salazar-González, J.-J. “International network optimization conference, Tenerife 2013” (2013) Electronic Notes in Discrete Mathematics, 41, pp. 1-3.

[73]  Gouveia, L., Riera-Ledesma, J., Salazar-González, J.-J. “Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route” (2013) Networks, 61 (4), pp. 309-321.

[72]  Gouveia, L., Salazar-González, J.-J. “Polynomial-time separation of Enhanced Reverse Multistar inequalities” (2013) Operations Research Letters, 41 (3), pp. 294-297.

[71]  Riera-Ledesma, J., Salazar-González, J.J. “A column generation approach for a school bus routing problem with resource constraints” (2013) Computers and Operations Research, 40 (2), pp. 566-583.

[70]  Rodríguez-Martín, I., José Salazar-González, J. “A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem” (2012) Journal of Heuristics, 18 (6), pp. 849-867.

[69]  Catanzaro, D., Labbé, M., Pesenti, R., Salazar-González, J.-J. “The balanced minimum evolution problem” (2012) INFORMS Journal on Computing, 24 (2), pp. 276-294.

[68]  Riera-Ledesma, J., Salazar-González, J.-J. “Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach” (2012) Computers and Operations Research, 39 (2), pp. 391-404.

[67]  Plum, C.E.M., Pisinger, D., Salazar-González, J.-J., Sigurd, M.M. “The multi-commodity one-to-one pickup-and-delivery traveling salesman problem with path duration limits” (2012) Lecture Notes in Engineering and Computer Science, 2196, pp. 1578-1581.

[66]  Ljubic, I., Putz, P., Salazar-González, J.-J. “Exact approaches to the single-source network loading problem” (2012) Networks, 59 (1), pp. 89-106.

[65]  Caprara, A., Letchford, A.N., Salazar-González, J.-J. “Decorous lower bounds for minimum linear arrangement” (2011) INFORMS Journal on Computing, 23 (1), pp. 26-40.

[64]  Rodríguez-Martín, I., Salazar-González, J.J. “The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: A matheuristic” (2011) Lecture Notes in Computer Science, 6701 LNCS, pp. 401-405.

[63]  Ljubic, I., Putz, P., Salazar-González, J.-J. “A heuristic algorithm for a prize-collecting local access network design problem” (2011) Lecture Notes in Computer Science, 6701 LNCS, pp. 139-144.

[62]  Feremans, C., Labbé, M., Letchford, A.N., Salazar-González, J.-J. “Generalized network design polyhedral” (2011) Networks, 58 (2), pp. 125-136.

[61]  Salazar-González, J.-J. “Branch-and-cut versus cut-and-branch algorithms for cell suppression” (2010) Lecture Notes in Computer Science, 6344 LNCS, pp. 29-40.

[60]  Salazar-González, J.-J. “Comments on: Routing problems with loading constraints” (2010) TOP, 18 (1), pp. 36-38.

[59]  Gouveia, L., Salazar-González, J.-J. “On the vehicle routing problem with lower bound capacities” (2010) Electronic Notes in Discrete Mathematics, 36 (C), pp. 1001-1008.

[58]  Caprara, A., Letchford, A.N., Salazar-González, J.-J. “Lower bounds for the minimum linear arrangement of a graph” (2010) Electronic Notes in Discrete Mathematics, 36 (C), pp. 843-849.

[57]  Rodríguez-Martín, I., José Salazar-González, J. “A local branching heuristic for the capacitated fixed-charge network design problem” (2010) Computers and Operations Research, 37 (3), pp. 575-581.

[56]  Schmid, V., Doerner, K.F., Hartl, R.F., Salazar-González, J.-J. “Hybridization of very large neighborhood search for ready-mixed concrete delivery problems” (2010) Computers and Operations Research, 37 (3), pp. 559-574.

[55]  Cordeau, J.-F., Iori, M., Laporte, G., Salazar-González, J.J. “A branch-and-cut algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO loading” (2010) Networks, 55 (1), pp. 46-59.

[54]  Hernández-Pérez, H., Salazar-González, J.-J. “The multi-commodity one-to-one pickup-and-delivery traveling salesman problem” (2009) European Journal of Operational Research, 196 (3), pp. 987-995.

[53]  Louveaux, F., Salazar-González, J.-J. “On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands” (2009) Mathematical Programming, 119 (1), pp. 169-194.

[52]  Hernández-Pérez, H., Rodríguez-Martín, I., Salazar-González, J.J. “A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem” (2009) Computers and Operations Research, 36 (5), pp. 1639-1645.

[51]  Catanzaro, D., Labbé, M., Pesenti, R., Salazar-González, J.-J. “Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion” (2009) Networks, 53 (2), pp. 126-140.

[50]  Delgado-Quintero, S., Salazar-González, J.-J. “A new approach for data editing and imputation” (2008) Mathematical Methods of Operations Research, 68 (3), pp. 407-428.

[48]  Salazar-González, J.-J. “Statistical confidentiality: Optimization techniques to protect tables” (2008) Computers and Operations Research, 35 (5), pp. 1638-1651.

[47]  Amaral, A.R.S., Caprara, A., Letchford, A.N., Salazar-Gonzalez, J.-J. “A New Lower Bound for the Minimum Linear Arrangement of a Graph” (2008) Electronic Notes in Discrete Mathematics, 30 (C), pp. 87-92.

[46]  Rodríguez-Martín, I., Salazar-González, J.J. “Solving a capacitated hub location problem” (2008) European Journal of Operational Research, 184 (2), pp. 468-479.

[45]  Hernández-Pérez, H., Salazar-González, J.-J. “The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms” (2007) Networks, 50 (4), pp. 258-272.

[44]  Baldacci, R., Dell'Amico, M., Gonzalez, J.S. “The capacitated m-ring-star problem” (2007) Operations Research, 55 (6), pp. 1147-1162.

[43]  Bermejo, I., García-Marco, I., Salazar-González, J.J. “An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection” (2007) Journal of Symbolic Computation, 42 (10), pp. 971-991.

[42]  Riera-Ledesma, J., Salazar-González, J.-J. “A branch-and-cut algorithm for the continuous error localization problem in data cleaning” (2007) Computers and Operations Research, 34 (9), pp. 2790-2804.

[41]  Riera-Ledesma, J., Salazar-González, J.-J. “A heuristic approach for the continuous error localization problem in data cleaning” (2007) Computers and Operations Research, 34 (8), pp. 2370-2383.

[40]  Iori, M., Salazar-González, J.-J., Vigo, D. “An exact approach for the vehicle routing problem with two-dimensional loading constraints” (2007) Transportation Science, 41 (2), pp. 253-264.  

[39]  Riera-Ledesma, J., Salazar-González, J.-J. “Solving the asymmetric traveling purchaser problem” (2006) Annals of Operations Research, 144 (1), pp. 83-97.

[38]  Salazar-González, J.-J. “Controlled rounding and cell perturbation: Statistical disclosure limitation methods for tabular data” (2006) Mathematical Programming, 105 (2-3), pp. 583-603. 

[37]  Letchford, A.N., Salazar-González, J.-J. “Projection results for vehicle routing” (2006) Mathematical Programming, 105 (2-3), pp. 251-274.

[36]  Salazar González, J.J. “A new approach to round tabular data” (2006) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4302, pp. 25-34.

[35]  Rodríguez-Martín, I., Salazar-González, J.-J. “An iterated local search heuristic for a capacitated hub location problem” (2006) Lecture Notes in Computer Science, 4030 LNCS, pp. 70-81.

[34]  Salazar-González, J.-J. “A unified mathematical programming framework for different statistical disclosure limitation methods” (2005) Operations Research, 53 (5), pp. 819-829.

[33]  Caprara, A., Salazar-González, J.-J. “Laying out sparse graphs with provably minimum bandwidth” (2005) INFORMS Journal on Computing, 17 (3), pp. 356-373.

[32]  Riera-Ledesma, J., Salazar-González, J.J. “A heuristic approach for the Travelling Purchaser Problem” (2005) European Journal of Operational Research, 162 (1), pp. 142-152.

[31]  Riera-Ledesma, J., Salazar-González, J.J. “The biobjective travelling purchaser problem” (2005) European Journal of Operational Research, 160 (3 SPEC. ISS.), pp. 599-613.

[30]  Labbé, M., Laporte, G., Martín, I.R., González, J.J.S. “Locating median cycles in networks” (2005) European Journal of Operational Research, 160 (2), pp. 457-470.

[29]  Hernández-Pérez, H., Salazar-González, J.-J. “A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery” (2004) Discrete Applied Mathematics, 145 (1 SPEC. ISS.), pp. 126-139.

[28]  Rodríguez-Martín, I., Salazar-González, J.-J. "Decomposition approaches for a capacitated hub problem(2004) Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), 3315, pp. 154-163.

[27]  Salazar-González, J.-J., Schoch, M. “A new tool for applying controlled rounding to a statistical table in Microsoft Excel” (2004) Lecture Notes in Computer Science, 3050, pp. 44-57.

[26]  Marval, F.J.L., Centeno, M.V., Salazar, J.J.G. “Heuristic for balancing a simple assembly line (SALBP, type-1 problem) [Heurístico para balancear una línea de ensamblaje simple (SALBP, problema tipo-1)]” (2004) Divulgaciones Matematicas, 12 (1), pp. 25-34.

[25]  Salazar-González, J.-J., Lowthian, P., Young, C., Merola, G., Bond, S., Brown, D. “Getting the best results in controlled rounding with the least effort” (2004) Lecture Notes in Computer Science, 3050, pp. 58-72.

[24]  Salazar-González, J.-J. “Mathematical models for applying cell suppression methodology in statistical data protection” (2004) European Journal of Operational Research, 154 (3), pp. 740-754.

[23]  Hernández-Pérez, H., Salazar-González, J.-J. “Heuristics for the one-commodity pickup-and-delivery traveling salesman problem” (2004) Transportation Science, 38 (2), pp. 245-255.

[22]  Labbé, M., Laporte, G., Martín, I.R., González, J.J.S. “The ring star problem: Polyhedral analysis and exact algorithm” (2004) Networks, 43 (3), pp. 177-189.

[21]  Labbé, M., Rodríguez-Martin, I., Salazar-González, J.J. “A branch-and-cut algorithm for the plant-cycle location problem” (2004) Journal of the Operational Research Society, 55 (5), pp. 513-520.

[20]  Laporte, G., Salazar-González, J.J., Semet, F. “Exact algorithms for the job sequencing and tool switching problem” (2004) IIE Transactions (Institute of Industrial Engineers), 36 (1), pp. 37-45.

[19]  Riera-Ledesma, J., Salazar-González, J.-J. “Algorithms for automatic data editing” (2003) Statistical Journal of the United Nations Economic Commission for Europe, 20 (3-4), pp. 255-264.

[18]  Hernández-Pérez, H., Salazar-González, J.-J. “The one-commodity pickup-and-delivery travelling salesman problem” (2003) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2570, pp. 89-104.

[17]  Laporte, G., Riera-Ledesma, J., Salazar-González, J.-J. “A branch-and-cut algorithm for the undirected traveling purchaser problem” (2003) Operations Research, 51 (6), pp. 940-951+1004.

[16]  Corberán, A., Mota, E., Salazar, J.J. “Some Recent Contributions to Routing and Location Problems” (2003) Networks, 42 (2), pp. 109-113.

[15]  Salazar-González, J.-J. “The Steiner cycle polytope” (2003) European Journal of Operational Research, 147 (3), pp. 671-679.

[14]  Fischetti, M., Salazar-González, J.-J. “Partial cell suppression: A new methodology for statistical disclosure control” (2003) Statistics and Computing, 13 (1), pp. 13-21.

[13]  Fischetti, M., Jacur, G.R., González, J.J.S. “Optimisation of the interconnecting network of a UMTS radio mobile telephone system” (2003) European Journal of Operational Research, 144 (1), pp. 56-67.

[12]  González, J.J.S. “Extending cell suppression to protect tabular data against several attackers” (2002) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2316, pp. 34-58.

[11]  Fischetti, M., Salazar-González, J.-J. “Combining complete and partial cell suppression methodologies in statistical disclosure control” (2001) Statistical Journal of the United Nations Economic Commission for Europe, 18 (4), pp. 355-361.

[10]  Fischetti, M., Salazar, J.J. “Solving the Cell Suppression Problem on tabular data with linear constraints” (2001) Management Science, 47 (7), pp. 1008-1027.

[9]  Fischetti, M., Salazar González, J.J. “Models and Algorithms for Optimizing Call Suppression in Tabular Data with Linear Constraints” (2000) Journal of the American Statistical Association, 95 (451), pp. 916-928.

[8]  Salazar, J.J. “A note on the generalized steiner tree polytope” (2000) Discrete Applied Mathematics, 100 (1-2), pp. 137-144.

[7]  Fischetti, M., Salazar, J.J. “Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control” (1999) Mathematical Programming, Series B, 84 (2), pp. 283-312.

[6]  Caprara, A., Salazar González, J.J. “Separating lifted odd-hole inequalities to solve the index selection problem” (1999) Discrete Applied Mathematics, 92 (2-3), pp. 111-134.

[5]  Fischetti, M., Gonzalez, J.J.S., Toth, P. “Solving the Orienteering Problem through branch-and-cut” (1998) INFORMS Journal on Computing, 10 (2), pp. 133-148.

[4]  Fischetti, M., González, J.J.S., Toth, P. “A branch-and-cut algorithm for the symmetric generalized traveling salesman problem” (1997) Operations Research, 45 (3), pp. 378-394.

[3]  Caprara, A., González, J.J.S. “A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem” (1996) TOP, 4 (1), pp. 135-163.

[2]  M. Fischetti, J.J. Salazar, P. Toth. “The Symmetric Generalized Traveling Salesman Polytope” (1995) Networks, 26, 113-123.

[1]  Bjorndal, M.H., Caprara, A., Cowling, P.I., Della Croce, F., Lourenço, H., Malucelli, F., Orman, A.J., Pisinger, D., Rego, C., Salazar, J.J. “Some thoughts on combinatorial optimisation” (1995) European Journal of Operational Research, 83 (2), pp. 253-270.