 | 2009 |
|---|
| 34 |       | 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.
Computers & OR 36(5): 1639-1645 (2009) |
| 33 | | Hipólito Hernández-Pérez,
Juan José Salazar González:
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem.
European Journal of Operational Research 196(3): 987-995 (2009) |
| 32 | | 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 |
|---|
| 31 | | Juan José Salazar González:
Statistical confidentiality: Optimization techniques to protect tables.
Computers & OR 35(5): 1638-1651 (2008) |
| 30 | | André R. S. Amaral,
Alberto Caprara,
Adam N. Letchford,
Juan José Salazar González:
A New Lower Bound for the Minimum Linear Arrangement of a Graph.
Electronic Notes in Discrete Mathematics 30: 87-92 (2008) |
| 29 | | Inmaculada Rodríguez Martín,
Juan José Salazar González:
Solving a capacitated hub location problem.
European Journal of Operational Research 184(2): 468-479 (2008) |
| 2007 |
|---|
| 28 | | Jorge Riera-Ledesma,
Juan José Salazar González:
A heuristic approach for the continuous error localization problem in data cleaning.
Computers & OR 34(8): 2370-2383 (2007) |
| 27 | | Jorge Riera-Ledesma,
Juan José Salazar González:
A branch-and-cut algorithm for the continuous error localization problem in data cleaning.
Computers & OR 34(9): 2790-2804 (2007) |
| 26 | | 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) |
| 25 | | 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) |
| 24 | | Manuel Iori,
Juan José Salazar González,
Daniele Vigo:
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints.
Transportation Science 41(2): 253-264 (2007) |
| 2006 |
|---|
| 23 | | 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 |
| 22 | | Juan José Salazar González:
A New Approach to Round Tabular Data.
Privacy in Statistical Databases 2006: 25-34 |
| 21 | | Jorge Riera-Ledesma,
Juan José Salazar González:
Solving the asymmetric traveling purchaser problem.
Annals OR 144(1): 83-97 (2006) |
| 20 | | Adam N. Letchford,
Juan José Salazar González:
Projection results for vehicle routing.
Math. Program. 105(2-3): 251-274 (2006) |
| 19 | | 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) |
| 2005 |
|---|
| 18 | | Martine Labbé,
Gilbert Laporte,
Inmaculada Rodríguez Martín,
Juan José Salazar González:
Locating median cycles in networks.
European Journal of Operational Research 160(2): 457-470 (2005) |
| 17 | | Jorge Riera-Ledesma,
Juan José Salazar González:
The biobjective travelling purchaser problem.
European Journal of Operational Research 160(3): 599-613 (2005) |
| 16 | | Jorge Riera-Ledesma,
Juan José Salazar González:
A heuristic approach for the Travelling Purchaser Problem.
European Journal of Operational Research 162(1): 142-152 (2005) |
| 15 | | Alberto Caprara,
Juan José Salazar González:
Laying Out Sparse Graphs with Provably Minimum Bandwidth.
INFORMS Journal on Computing 17(3): 356-373 (2005) |
| 2004 |
|---|
| 14 | | Inmaculada Rodríguez Martín,
Juan José Salazar González:
Decomposition Approaches for a Capacitated Hub Problem.
IBERAMIA 2004: 154-163 |
| 13 | | 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 |
| 12 | | 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 |
| 11 | | 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.
Discrete Applied Mathematics 145(1): 126-139 (2004) |
| 10 | | Juan José Salazar González:
Mathematical models for applying cell suppression methodology in statistical data protection.
European Journal of Operational Research 154(3): 740-754 (2004) |
| 9 | | 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) |
| 8 | | Hipólito Hernández-Pérez,
Juan José Salazar González:
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem.
Transportation Science 38(2): 245-255 (2004) |
| 2003 |
|---|
| 7 | | Matteo Fischetti,
Giorgio Romanin-Jacur,
Juan José Salazar González:
Optimisation of the interconnecting network of a UMTS radio mobile telephone system.
European Journal of Operational Research 144(1): 56-67 (2003) |
| 6 | | Juan José Salazar González:
The Steiner cycle polytope.
European Journal of Operational Research 147(3): 671-679 (2003) |
| 5 | | Matteo Fischetti,
Juan José Salazar González:
Partial cell suppression: A new methodology for statistical disclosure control.
Statistics and Computing 13(1): 13-21 (2003) |
| 2002 |
|---|
| 4 | | Juan José Salazar González:
Extending Cell Suppression to Protect Tabular Data against Several Attackers.
Inference Control in Statistical Databases 2002: 34-58 |
| 2001 |
|---|
| 3 | | 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 |
| 1999 |
|---|
| 2 | | Alberto Caprara,
Juan José Salazar González:
Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem.
Discrete Applied Mathematics 92(2-3): 111-134 (1999) |
| 1998 |
|---|
| 1 | | Matteo Fischetti,
Juan José Salazar González,
Paolo Toth:
Solving the Orienteering Problem through Branch-and-Cut.
INFORMS Journal on Computing 10(2): 133-148 (1998) |
