default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan José Salazar González
Juan José Salazar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j87]Manuel Iori, Alberto Locatelli
, Marco Locatelli, Juan José Salazar González:
Tool switching problems with tool order constraints. Discret. Appl. Math. 347: 249-262 (2024)- [j86]Daniel Díaz-Ríos, Juan José Salazar González:
Mathematical formulations for consistent travelling salesman problems. Eur. J. Oper. Res. 313(2): 465-477 (2024) - [e1]Amitabh Basu, Ali Ridha Mahjoub, Juan José Salazar González:
Combinatorial Optimization - 8th International Symposium, ISCO 2024, La Laguna, Tenerife, Spain, May 22-24, 2024, Revised Selected Papers. Lecture Notes in Computer Science 14594, Springer 2024, ISBN 978-3-031-60923-7 [contents] - 2023
- [j85]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: 106076 (2023) - 2022
- [j84]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): 467-483 (2022) - [c17]Daniel Díaz-Ríos, Juan José Salazar González:
The Biobjective Consistent Traveling Salesman Problem. ICCL 2022: 120-131 - [c16]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: 260-271 - 2021
- [j83]Jorge Riera-Ledesma, Juan José Salazar González:
Selective routing problem with synchronization. Comput. Oper. Res. 135: 105465 (2021) - [j82]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): 470-484 (2021) - [j81]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): 122-138 (2021)
2010 – 2019
- 2019
- [j80]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): 24-31 (2019) - [j79]Tolga Bektas, Luis 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): 452-463 (2019) - [j78]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): 575-584 (2019) - [j77]Enrique Benavent, Mercedes Landete, Juan José Salazar González, Gregorio Tirado:
The probabilistic pickup-and-delivery travelling salesman problem. Expert Syst. Appl. 121: 313-323 (2019) - [c15]Hipólito Hernández-Pérez, Juan José Salazar González:
Optimal Solutions for the Vehicle Routing Problem with Split Demands. ICCL 2019: 189-203 - 2018
- [j76]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: 56-64 (2018) - [j75]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: 1-17 (2018) - [j74]Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
The connected facility location polytope. Discret. Appl. Math. 234: 151-167 (2018) - [j73]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): 1463-1478 (2018) - [c14]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: 295-305 - [c13]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: 241-252 - 2017
- [j72]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: 247-256 (2017) - [j71]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): 54-66 (2017) - [j70]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): 14-27 (2017) - [j69]Valentina Cacchiani, Juan José Salazar González:
Optimal Solutions to a Real-World Integrated Airline Scheduling Problem. Transp. Sci. 51(1): 250-268 (2017) - 2016
- [j68]Karl F. Doerner, Juan José Salazar González, Christian Stummer:
Preface. Ann. Oper. Res. 236(2): 291-293 (2016) - [j67]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: 102-112 (2016) - [j66]Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman:
Hierarchical Survivable Network Design Problems. Electron. Notes Discret. Math. 52: 229-236 (2016) - [j65]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): 44-52 (2016) - [j64]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): 74-84 (2016) - [j63]Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman:
The ring/κ-rings network design problem: Model and branch-and-cut algorithm. Networks 68(2): 130-140 (2016) - [j62]François V. Louveaux, Juan José Salazar González:
Solving the Single Vehicle Routing Problem with Variable Capacity. Transp. Sci. 50(2): 708-719 (2016) - 2015
- [j61]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): 730-738 (2015) - 2014
- [j60]María-Salomé Hernández-García, Juan José Salazar González:
Enhanced controlled tabular adjustment. Comput. Oper. Res. 43: 61-67 (2014) - [j59]Christian E. M. Plum, David Pisinger, Juan José Salazar González, Mikkel Sigurd:
Single liner shipping service design. Comput. Oper. Res. 45: 1-6 (2014) - [j58]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: 161-174 (2014) - [j57]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): 727-739 (2014) - [j56]Hipólito Hernández-Pérez, Juan José Salazar González:
The multi-commodity pickup-and-delivery traveling salesman problem. Networks 63(1): 46-59 (2014) - [c12]Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
On the Asymmetric Connected Facility Location Polytope. ISCO 2014: 371-383 - [c11]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: 24-35 - [p1]Karl F. Doerner, Juan José Salazar González:
Pickup-and-Delivery Problems for People Transportation. Vehicle Routing 2014: 193-212 - 2013
- [j55]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): 566-583 (2013) - [j54]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): 2103-2115 (2013) - [j53]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: 1-3 (2013) - [j52]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: 391-398 (2013) - [j51]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): 309-321 (2013) - [j50]Luis Eduardo Neves Gouveia, Juan José Salazar González:
Polynomial-time separation of Enhanced Reverse Multistar inequalities. Oper. Res. Lett. 41(3): 294-297 (2013) - 2012
- [j49]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): 391-404 (2012) - [j48]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): 849-867 (2012) - [j47]Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González:
The Balanced Minimum Evolution Problem. INFORMS J. Comput. 24(2): 276-294 (2012) - [j46]Ivana Ljubic, Peter Putz, Juan José Salazar González:
Exact approaches to the single-source network loading problem. Networks 59(1): 89-106 (2012) - 2011
- [j45]Alberto Caprara, Adam N. Letchford, Juan José Salazar González:
Decorous Lower Bounds for Minimum Linear Arrangement. INFORMS J. Comput. 23(1): 26-40 (2011) - [j44]Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González:
Generalized network design polyhedra. Networks 58(2): 125-136 (2011) - [c10]Ivana Ljubic, Peter Putz, Juan José Salazar González:
A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem. INOC 2011: 139-144 - [c9]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: 401-405 - 2010
- [j43]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): 559-574 (2010) - [j42]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): 575-581 (2010) - [j41]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: 843-849 (2010) - [j40]Luis Eduardo Neves Gouveia, Juan José Salazar González:
On the Vehicle Routing Problem with lower bound capacities. Electron. Notes Discret. Math. 36: 1001-1008 (2010) - [j39]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): 46-59 (2010) - [c8]Juan José Salazar González:
Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression. Privacy in Statistical Databases 2010: 29-40
2000 – 2009
- 2009
- [j38]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): 1639-1645 (2009) - [j37]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): 987-995 (2009) - [j36]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): 169-194 (2009) - [j35]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): 126-140 (2009) - 2008
- [j34]Juan José Salazar González:
Statistical confidentiality: Optimization techniques to protect tables. Comput. Oper. Res. 35(5): 1638-1651 (2008) - [j33]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: 87-92 (2008) - [j32]Inmaculada Rodríguez Martín, Juan José Salazar González:
Solving a capacitated hub location problem. Eur. J. Oper. Res. 184(2): 468-479 (2008) - [j31]Sergio Delgado-Quintero, Juan José Salazar González:
A new approach for data editing and imputation. Math. Methods Oper. Res. 68(3): 407-428 (2008) - 2007
- [j30]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): 2370-2383 (2007) - [j29]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): 2790-2804 (2007) - [j28]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): 971-991 (2007) - [j27]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): 258-272 (2007) - [j26]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): 253-264 (2007) - 2006
- [j25]Jorge Riera-Ledesma, Juan José Salazar González:
Solving the asymmetric traveling purchaser problem. Ann. Oper. Res. 144(1): 83-97 (2006) - [j24]Adam N. Letchford, Juan José Salazar González:
Projection results for vehicle routing. Math. Program. 105(2-3): 251-274 (2006) - [j23]Juan José Salazar González:
Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data. Math. Program. 105(2-3): 583-603 (2006) - [c7]Inmaculada Rodríguez Martín, Juan José Salazar González:
An Iterated Local Search Heuristic for a Capacitated Hub Location Problem. Hybrid Metaheuristics 2006: 70-81 - [c6]Juan José Salazar González:
A New Approach to Round Tabular Data. Privacy in Statistical Databases 2006: 25-34 - 2005
- [j22]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): 457-470 (2005) - [j21]Jorge Riera-Ledesma, Juan José Salazar González:
The biobjective travelling purchaser problem. Eur. J. Oper. Res. 160(3): 599-613 (2005) - [j20]Jorge Riera-Ledesma, Juan José Salazar González:
A heuristic approach for the Travelling Purchaser Problem. Eur. J. Oper. Res. 162(1): 142-152 (2005) - [j19]Alberto Caprara, Juan José Salazar González:
Laying Out Sparse Graphs with Provably Minimum Bandwidth. INFORMS J. Comput. 17(3): 356-373 (2005) - [j18]Juan José Salazar González:
A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods. Oper. Res. 53(5): 819-829 (2005) - 2004
- [j17]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): 126-139 (2004) - [j16]Juan José Salazar González:
Mathematical models for applying cell suppression methodology in statistical data protection. Eur. J. Oper. Res. 154(3): 740-754 (2004) - [j15]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): 513-520 (2004) - [j14]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): 177-189 (2004) - [j13]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): 245-255 (2004) - [c5]Inmaculada Rodríguez Martín, Juan José Salazar González:
Decomposition Approaches for a Capacitated Hub Problem. IBERAMIA 2004: 154-163 - [c4]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: 44-57 - [c3]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: 58-72 - 2003
- [j12]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): 56-67 (2003) - [j11]Juan José Salazar González:
The Steiner cycle polytope. Eur. J. Oper. Res. 147(3): 671-679 (2003) - [j10]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): 940-951 (2003) - [j9]Angel Corberán, Enrique Mota, Juan José Salazar:
Some recent contributions to routing and location problems. Networks 42(2): 109-113 (2003) - [j8]Matteo Fischetti, Juan José Salazar González:
Partial cell suppression: A new methodology for statistical disclosure control. Stat. Comput. 13(1): 13-21 (2003) - 2002
- [c2]Juan José Salazar González:
Extending Cell Suppression to Protect Tabular Data against Several Attackers. Inference Control in Statistical Databases 2002: 34-58 - 2001
- [j7]Matteo Fischetti, Juan José Salazar:
Solving the Cell Suppression Problem on Tabular Data with Linear Constraints. Manag. Sci. 47(7): 1008-1027 (2001) - [c1]Hipólito Hernández-Pérez, Juan José Salazar González:
The One-Commodity Pickup-and-Delivery Travelling Salesman Problem. Combinatorial Optimization 2001: 89-104 - 2000
- [j6]Juan José Salazar:
A note on the generalized steiner tree polytope. Discret. Appl. Math. 100(1-2): 137-144 (2000)
1990 – 1999
- 1999
- [j5]Alberto Caprara, Juan José Salazar González:
Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem. Discret. Appl. Math. 92(2-3): 111-134 (1999) - [j4]Matteo Fischetti, Juan José Salazar:
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control. Math. Program. 84(2): 283-312 (1999) - 1998
- [j3]Matteo Fischetti, Juan José Salazar González, Paolo Toth:
Solving the Orienteering Problem through Branch-and-Cut. INFORMS J. Comput. 10(2): 133-148 (1998) - 1997
- [j2]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): 378-394 (1997) - 1995
- [j1]Matteo Fischetti, Juan José Salazar González, Paolo Toth:
The symmetric generalized traveling salesman polytope. Networks 26(2): 113-123 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
