Search the dblp DataBase
Juan José Salazar González :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Hipólito Hernández-Pérez , Juan José Salazar González The One-Commodity Pickup-and-Delivery Travelling Salesman Problem. [Citation Graph (0, 0)][DBLP ] Combinatorial Optimization, 2001, pp:89-104 [Conf ] Inmaculada Rodríguez Martín , Juan José Salazar González An Iterated Local Search Heuristic for a Capacitated Hub Location Problem. [Citation Graph (0, 0)][DBLP ] Hybrid Metaheuristics, 2006, pp:70-81 [Conf ] Inmaculada Rodríguez Martín , Juan José Salazar González Decomposition Approaches for a Capacitated Hub Problem. [Citation Graph (0, 0)][DBLP ] IBERAMIA, 2004, pp:154-163 [Conf ] Juan José Salazar González Extending Cell Suppression to Protect Tabular Data against Several Attackers. [Citation Graph (0, 0)][DBLP ] Inference Control in Statistical Databases, 2002, pp:34-58 [Conf ] Juan José Salazar González A New Approach to Round Tabular Data. [Citation Graph (0, 0)][DBLP ] Privacy in Statistical Databases, 2006, pp:25-34 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] Privacy in Statistical Databases, 2004, pp:58-72 [Conf ] Juan José Salazar González , Markus Schoch A New Tool for Applying Controlled Rounding to a Statistical Table in Microsoft Excel. [Citation Graph (0, 0)][DBLP ] Privacy in Statistical Databases, 2004, pp:44-57 [Conf ] Alberto Caprara , Juan José Salazar González Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:111-134 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:145, n:1, pp:126-139 [Journal ] Alberto Caprara , Juan José Salazar González Laying Out Sparse Graphs with Provably Minimum Bandwidth. [Citation Graph (0, 0)][DBLP ] INFORMS Journal on Computing, 2005, v:17, n:3, pp:356-373 [Journal ] Juan José Salazar González Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data. [Citation Graph (0, 0)][DBLP ] Math. Program., 2006, v:105, n:2-3, pp:583-603 [Journal ] Adam N. Letchford , Juan José Salazar González Projection results for vehicle routing. [Citation Graph (0, 0)][DBLP ] Math. Program., 2006, v:105, n:2-3, pp:251-274 [Journal ] Martine Labbé , Gilbert Laporte , Inmaculada Rodríguez Martín , Juan José Salazar González The Ring Star Problem: Polyhedral analysis and exact algorithm. [Citation Graph (0, 0)][DBLP ] Networks, 2004, v:43, n:3, pp:177-189 [Journal ] Jorge Riera-Ledesma , Juan José Salazar González A heuristic approach for the Travelling Purchaser Problem. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:162, n:1, pp:142-152 [Journal ] Jorge Riera-Ledesma , Juan José Salazar González The biobjective travelling purchaser problem. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:160, n:3, pp:599-613 [Journal ] Martine Labbé , Gilbert Laporte , Inmaculada Rodríguez Martín , Juan José Salazar González Locating median cycles in networks. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2005, v:160, n:2, pp:457-470 [Journal ] Juan José Salazar González Mathematical models for applying cell suppression methodology in statistical data protection. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2004, v:154, n:3, pp:740-754 [Journal ] Matteo Fischetti , Giorgio Romanin Jacur , Juan José Salazar González Optimisation of the interconnecting network of a UMTS radio mobile telephone system. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2003, v:144, n:1, pp:56-67 [Journal ] Juan José Salazar González The Steiner cycle polytope. [Citation Graph (0, 0)][DBLP ] European Journal of Operational Research, 2003, v:147, n:3, pp:671-679 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] J. Symb. Comput., 2007, v:42, n:10, pp:971-991 [Journal ] A heuristic approach for the continuous error localization problem in data cleaning. [Citation Graph (, )][DBLP ] A branch-and-cut algorithm for the continuous error localization problem in data cleaning. [Citation Graph (, )][DBLP ] Statistical confidentiality: Optimization techniques to protect tables. [Citation Graph (, )][DBLP ] A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. [Citation Graph (, )][DBLP ] A local branching heuristic for the capacitated fixed-charge network design problem. [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.281secs