Juan-José Salazar-González

 

  facebook19x19       twitter23x23       friendfeed       linkmein22x22         

Download a CV from:  GoogleScholar     and     SCOPUS    and     ResearchGate  and  mas

http://scholar.google.es/citations?user=pd7y0AcAAAAJ&hl=en&oi=ao

http://www.scopus.com/authid/detail.url?authorId=7003911626

http://www.researchgate.net/profile/Juan_Jose_Salazar_Gonzalez/

http://academic.research.microsoft.com/Author/43895933  

http://orcid.org/0000-0001-5683-0271

http://www.researcherid.com/rid/C-3671-2014

 

Organizing an international conference: “International Network Optimization Conference”, Tenerife, 20-22 May 2013

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

Leader at ULL of a European-funded research project in the VII framework ( INFRA-2010-1.1.3 ): “Data without Boundaries”

Leader at ULL of a Spanish-funded research project: MTM2012-36163-C06-01.

Leader at ULL of a consultancy contract for Westat

Leader at ULL of a consultancy contract for “Binter

 Canarias”

Developing a Data Editing Software in use at ISTAC and other statistical agencies: “TEIDE 1.0” and “TEIDE 2.0

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

Work address:                     Departamento de Estadística, Investigación Operativa y Computación

                                               Facultad de Matemáticas - Universidad de La Laguna

                                               Av. Astrofísico Francisco Sánchez, s/n

                                               38271 La Laguna, Tenerife, Spain

Telephone number:           +34 922 318184

Fax number:                        +34 922 318170

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 )




 

Some scientific publications

*   Bjorndal, Caprara, Cowling, Della Croce, Lourenço, Mallucelli, Orman, Pisinger, Salazar. “Some Thoughts on Combinatorial Optimization” European Journal of Operational Research 83/2 (1995) 253-270 http://dx.doi.org/10.1016/0377-2217(95)00005-B

*   M. Fischetti, J.J. Salazar, P. Toth. “The Symmetric Generalized Traveling Salesman Polytope” Networks 26 (1995) 113-123 http://dx.doi.org/10.1002/net.3230260206

*   A. Caprara, J.J. Salazar. “A Branch-and-Cut Algorithm for a Generalization of the Facility Location Problem” Trabajos de Investigación Operativa (TOP) 4/1 (1996) 135-163 http://dx.doi.org/10.1007/BF02568608

*   M. Fischetti, J.J. Salazar, P. Toth. “A Branch-and-Cut Algorithm for the Symmetric Generalized Travelling Salesman Problem” Operations Research 45/3 (1997) 378-394

*   M. Fischetti, J.J. Salazar, P. Toth. “Solving the Orienteering Problem through Branch-and-Cut”  INFORMS Journal on Computing 10/2 (1998) 133-148

*   M. Fischetti, J.J. Salazar. “Computational Experience with the Controlled Rounding Problem in Statistical Disclosure Control” Journal of Official Statistics 14/4 (1998) 553-565

*   M. Fischetti, J.J. Salazar. “Models and Algorithms for the 2-Dimensional Cell Suppression Problem in Statistical Disclosure Control” Mathematical Programming 84 (1999) 283-312 http://dx.doi.org/10.1007/s10107980022a

*   A. Caprara, J.J. Salazar. “Separating lifted odd-hole inequalities to solve the index selection problem” Discrete Applied Mathematics 92 (1999) 111-134 http://dx.doi.org/10.1016/S0166-218X(99)00050-5

*   J.J. Salazar. “A note on the generalized steiner tree polytope” Discrete Applied Mathematics 100 (2000) 137-144 http://dx.doi.org/10.1016/S0166-218X(99)00200-0

*   M. Fischetti, J.J. Salazar. “Models and Algorithms for Optimizing Cell Suppression in Tabular Data with Linear Constraints” Journal of the American Statistical Association 95 (2000) 916-928

*   M. Fischetti, J.J. Salazar. “Solving the Cell Suppression Problem on Tabular Data with Linear Constraints” Management Science 47/7 (2001) 1008-1026

*   M. Fischetti, J.J. Salazar. “Combining complete and partial cell suppression methodologies in statistical disclosure control” Statistical Journal of the United Nations Economic Commission for Europe 18/4 (2001) 355-364

*   H. Hernández Pérez, J.J. Salazar González. “The one-commodity Pickup-and-Delivery Traveling Salesman Problem” In “Eureka! You shrink”  (edited by M. Jünger, G. Reinelt, G. Rinaldi) Springer Lecture Notes in Computer Science 2570 (2002) 89-104

*   M. Fischetti, J.J. Salazar González, P. Toth. “The Generalized Traveling Salesman Problem” In “The Traveling Salesman Problem and Its Variations” Ed. Kluwer Academic Publishers ISBN: 1-4020-0664-0 CO 12 (2002) 609-662

*   J.J. Salazar González. “Extending Cell Suppression to Protect Tabular Data against Several Attackers” In “Inference Control in Statistical Databases” (edited by J. Domingo-Ferrer) Springer Lecture Notes in Computer Science 2316 (2002) 34-58

*   M. Fischetti, J.J. Salazar. “Partial Cell Suppression: a New Methodology for Statistical Disclosure Control” Statistics and Computing 13 (2003) 13-21

*   M. Fischetti, G. Romanin Jacur, J.J. Salazar. “Optimisation of the interconnection network of a UMTS radio mobile telephone system” European Journal of Operational Research 144 (2003) 56-67

*   G. Laporte, J. Riera Ledesma, J.J. Salazar González. “A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem” Operations Research 51/66 (2003) 940-951

*   Corberán, E. Mota, J.J. Salazar González. “Some recent contributions to routing and location problems” Networks 42 (2003) 109-113

*   J.J. Salazar González. “The Steiner cycle polytope” European Journal of Operational Research 147 (2003) 671-679

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

*   H. Hernández Pérez, J.J. Salazar González. “A Branch and Cut Algorithm for the Traveling Salesman Problem with Pickups and Deliveries” Discrete Applied Mathematics 145 (2004) 126-139  Prize

*   G. Laporte, J.J. Salazar González, F. Semen. “Exact Algorithms for the Job Sequencing and Tool Switching Problem” IIE Transactions 36 (2004) 37-45

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

*   M. Labbe, G. Laporte, I. Rodríguez Martín, J.J. Salazar González. “The Ring Star Problem: Polyhedral Analysis and Exact Algorithm” Networks 43 /2004) 177-189  Prize.

*   H. Hernández Pérez, J.J. Salazar González. “Heuristics for the one-commodity Pickup-and-Delivery Traveling Salesman Problem” Transportation Science 38 (2004) 245-255

*   M. Labbe, I. Rodríguez Martín, J.J. Salazar González. “A Branch-and-Cut Algorithm for the Plant-Cycle Location Problem” Journal of the Operational Research Society 55/5 (2004) 513-520

*   J.J. Salazar, P. Lowthian, C. Young, G. Merola, S. Bond, D. Brown.  “Getting the Best Results in Controlled Rounding with the Least Effort” In “Privacy in Statistical Databases” (edited by J. Domingo-Ferrer) Springer Lecture Notes in Computer Science 3050 (2004) 58-72

*   J.J. Salazar González, M. Schoch. “A new tool for applying Controlled Rounding to a Statistical Table in Microsoft Excel” In “Privacy in Statistical Databases” (edited by J. Domingo-Ferrer) Springer Lecture Notes in Computer Science  3050 (2004) 44-57

*   I. Rodríguez Martín, J.J. Salazar González. “Decomposition Approaches for a Capacitated Hub Problem” In “IBERAMIA 2004” (edited by C. Lemaître, C.A. Reyes and J.A. Gonzalez) Springer Lecture Notes in Artificial Intelligence 3315 (2004) 154-163

*   J. Riera Ledesma, J.J. Salazar González. “The Biobjective Travelling Purchaser Problem” European Journal of Operational Research 160/3 (2005) 599-613

*   J. Riera Ledesma, J.J. Salazar González. “A Heuristic Approach for the Traveling Purchaser Problem” European Journal of Operational Research 162 (2005) 142-152

*   M. Labbe, G. Laporte, I. Rodríguez Martín, J.J. Salazar González. “Locating Median Cycles in Networks” European Journal of Operational Research 160/2 (2005) 457-470

*   A. Caprara, J.J. Salazar González. “Laying Out Sparse Graphs with Provably Minimum Bandwidth” INFORMS Journal on Computing 17/3 (2005) 356-373

*   J. J. Salazar González. “A Unified Mathematical Programming Framework for different Statistical Disclosure Limitation Methods” Operations Research 53/5 (2005) 819-829

*   J. J. Salazar González. “Controlled Rounding and Cell Perturbation: Statistical Disclosure Limitation Methods for Tabular Data” Mathematical Programming  105 (2005) 583-603

*   A. Letchford, J. J. Salazar González. “Projection of Flow Variables for Vehicle Routing” Mathematical Programming  105 (2005) 251-274               

*   I. Rodríguez Martín, J. J. Salazar González. “An Iterated Local Search Heuristic for a Capacitated Hub Location Problem” In “Hybrid Metaheuristic 2006” Springer Lecture Notes in Computer Science 4030 (2006) 70-81

*   J.J. Salazar González, “A New Approach to Round Tabular Data”, In “Privacy Statistical Databases 2006, Springer Lecture Notes in Computer Science 4302 (2006) 25-34

*   J. Riera Ledesma, J. J. Salazar González. “Solving the Asymmetric Traveling Purchaser Problem” Annals of Operations Research 144 (2006) 83-97

*   J. Riera-Ledesma, J. J. Salazar González. “A Heuristic Approach for the Continuous Error Localization Problem in Data Cleaning” Computers & Operations Research  34 (2007) 2370-2383

*   J. Riera-Ledesma, J. J. Salazar González. “A branch-and-cut algorithm for the Error Location Problem in Data Cleaning” Computers & Operations Research 34 (2007) 2990-2804.

*   M. Iori, J.J. Salazar González, D. Vigo, “An exact approach for capacitated vehicle routing problems with two-dimensional loading constraints”, Trasnportation Science 41/2 (2007) 253-26

*   I. Bermejo, I. García Marco, J.J. Salazar González, “An Algorithm to Check whether the toric ideal of an affine monomial curve is a complete intersection”, Journal of Symbolic Computation 42/10 (2007) 971-991

*   H. Hernández-Pérez, J.J. Salazar González, “The one-commodity Pickup-and-Delivery Travelling Salesman Problem: inequalities and algorithms”, Networks 4 (2007) 258-272.

*   R. Baldacci, M. Dell’Amico, J.J. Salazar González, “The Capacitated m-Ring Star Problem”, Operations Research 55/6 (2007) 1147-1162

*   J.J. Salazar González, “Statistical Confidentiality: Optimization Techniques to Protect Tables”, Computers & Operations Research 35 (2008) 1638-1651

*   I. Rodríguez Martín, J.J. Salazar González, “Solving a Capacitated Hub Location Problem”, European Journal of Operational Research 184/2 (2008) 468-479

*   A. R. S. Amaral, A. Caprara, A. Letchford, J.J. Salazar González, “A New Lower Bound for the Minimum Linear Arrangement of a Graph”, Electronic Notes in Discrete Mathematics 30 (2008) 87-92

*   S. Delgado Quintero, J. J. Salazar González, “A new approach for Data Editing and Imputation”, Mathematical Methods of Operations Research 68 (2008) 407-428

*   D. Catanzaro, M. Labbé, R. Pesenti, J.J. Salazar González, “Mathematical Models to Reconstruct Phylogenetic Trees” Networks 53 (2009) 126-140

*   F. Louveaux, J. J. Salazar González, “On the one-to-one pickup-and-delivery travelling salesman problem with stochastic demands”, Mathematical Programming 119/1 (2009) 169-194

*   H. Hernández Pérez, I. Rodríguez Martín, J. J. Salazar González, “A hybrid GRASP/VND heuristic for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem”, Computers & Operations Research 36 (2009) 1639-1645

*   H. Hernández Pérez, J. J. Salazar González, “The one-to-one multi-commodity Pickup-and-Delivery Traveling Salesman Problem”, European Journal of Operational Research 196/3 (2009) 987-995

*   J.F. Cordeau, M. Iori, G. Laporte, J.J. Salazar González, “Branch-and-Cut Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading”, Networks 55 (2010) 46-59

*   Verena Schmid, Karl F. Doerner, Richard F. Hartl, J. J. Salazar González, “Hybridization of Local Branching guided by Variable Neighborhood Search for Ready-Mixed Concrete Delivery Problems”, Computers & Operational Research 37 (2010) 559-574

*   I. Rodríguez Martín, J. J. Salazar González, “A Local Branching Heuristic for the Capacitated Fixed-Charge Network Design Problem”, Computers & Operations Research 37 (2010) 575-581

*   A. Caprara, A. Letchford, J.J. Salazar González, “Lower Bounds for the Minimum Linear Arrangement of a Graph”, Electronic Notes in Discrete Mathematics 36 (2010) 843-849

*   L. Gouveia, J.J. Salazar González, “On the Vehicle Routing Problem with lower bound capacities”, Electronic Notes in Discrete Mathematics 36 (2010) 1001-1008

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

*   J.J. Salazar González, “Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression”, Lecture Notes in Computer Science 6344 (2010) 29-40

*   C. Feremans, M. Labbé, A. Letchford, J. J. Salazar González, “Generalized Network Design Polyhedra”, Networks 58/2 (2011) 125-136

*   A. Caprara, A.N. Letchford, J.J. Salazar González, “Decorous Lower Bounds for Minimum Linear Arrangement”, INFORMS Journal on Computing 23/1 (2011) 26-40

*   G.T. Duncan, M. Elliot, J.J. Salazar González, “Statistical Confidentiality: Principles and Practice”, Springer, 2011

*   I. Ljubic, P. Putz, J.J. Salazar González, “A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem”, Lecture Notes in Computer Science 6701 (2011) 139-144

*   I. Rodríguez Martín, J.J. Salazar González, “The Multi-Commodity One-to-One Pickup-and-Delivery Travelling Salesman Problem: A Matheuristic”, Lecture Notes in Computer Science 6701 (2011) 401-405

*   I. Ljubic, P. Putz, J.J. Salazar González, “Exact Approaches to the Single Source Network Loading Problem”, Networks 59/1 (2012) 89--106

*   J. Riera, J.J. Salazar González, “Solving School Bus Routing using the Multiple Vehicle Traveling Purchaser Problem: a Branch-and-Cut Approach”, Computers & Operations Research 39/2 (2012) 391-404

*   D. Catanzaro, M. Labbé, R. Pesenti, J.J. Salazar González, “The Balanced Minimum Evolution Problem”, INFORMS Journal on Computing 24/2 (2012) 276-294

*   I. Rodríguez Martín, J.J. Salazar González, “A hybrid heuristic approach for the Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem”, Journal of Heuristics 12/6 (2012) 849-867

*   J. Riera, J.J. Salazar González, “A Column Generation Approach for a School Bus Routing Problem with Resource Constraints”, Computers & Operations Research 40/2 (2013) 566-583

*   J.J. Salazar González, “Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier”, OMEGA (2013) to appear.

*   L. Gouveia, J. Riera-Ledesma, J.J. Salazar-González, “Reverse Multistar Inequalities and Vehicle Routing Problems with lower bound capacities”, Networks (2013) to appear.

*   H. Hernández-Pérez, J.J. Salazar González, “The multi-commodity Pickup-and-Delivery Traveling Salesman Problem”, Networks (2013) to appear.

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

*   L. Gouveia, J.J. Salazar González, “Polynomial-time separation of Enhanced Reverse Multistar Inequalities”, Operations Research Letters 41 (2013) 294-297

*   H. Hernández-Pérez, J. Riera-Ledesma, I. Rodríguez-Martín, Juan-José Salazar-González, “International Network Optimization Conference, Tenerife 2013”, Electronic Notes in Discrete Mathematics 41 (2013) 1-3

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

*   I. Ljubic, P. Putz, J.J. Salazar González, “A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem”, submitted to EJOR.

*   F. Louveaux, J.J. Salazar González, “Solving the single vehicle routing problem with variable capacity”, submitted to Transportation Science.

*   M.S. Hernández García, J.J. Salazar González, “Enhanced Controlled Tabular Adjustment”, submitted to Computers & Operations Research.

*   Nikhil Bansal, Matteo Fischetti, Giuseppe Lancia, Adam N. Letchford, Andrea Lodi, Michele Monaci, Ulrich Pferschy, David Pisinger, Juan-José Salazar-González, Maxim Sviridenko, and Paolo Toth, OPTIMA “Mathematical Optimization Society Newsletter” 91 (2013).

 

Old research topics:

·  Generalized Traveling Salesman Problem

·  Orienteering Problem

·  Cycle Problem

·  Index Selection Problem

·  Vehicle Routing Problem

·  Generalized Steiner Tree Problem

·  Cell Suppression Problem

·  Controlled Rounding Problem

·  Median Cycle Problem

·  Mobile Telephone Location Problem

·  Traveling Purcharser Problem

·  Pickup-and-Delivery Travelling Salesman Problem

·  Bandwidth Problem

·  Seriation Problem

       

<hr size=2 width="100%" align=center>

 

Statistics on visits to this page: http://es.nedstat.net/cgi-bin/nedstat.gif?name=jjsalaza