Salazar-Gonzlez Juan-Jos

Juan-Jos Salazar-Gonzlez

Information about the author Juan-Jos Salazar-Gonzlez will soon be added to the site.
Found 17 papers in total
Optimal Solutions to a Real-World Integrated Airline Scheduling Problem
Optimal Solutions to a Real-World Integrated Airline Scheduling Problem
2017
We study an integrated airline scheduling problem for a regional carrier. It...
The ring/κ-rings network design problem: Model and branch-and-cut algorithm
The ring/κ-rings network design problem: Model and branch-and-cut algorithm
2016
This article considers the problem of designing a two‐level network where the...
A branch-and-cut algorithm for two-level survivable network design problems
A branch-and-cut algorithm for two-level survivable network design problems
2016
This paper approaches the problem of designing a two-level network protected against...
The multi-commodity pickup-and-delivery traveling salesman problem
The multi-commodity pickup-and-delivery traveling salesman problem
2014
The ‘multi‐commodity Pickup‐and‐Delivery Traveling Salesman...
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch‐and‐cut approach
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch‐and‐cut approach
2012
School bus routing problems, combining bus stop selection and bus route generation,...
The Balanced Minimum Evolution Problem
The Balanced Minimum Evolution Problem
2012
Aphylogeny is an unrooted binary tree that represents the evolutionary relationships...
Decorous Lower Bounds for Minimum Linear Arrangement
Decorous Lower Bounds for Minimum Linear Arrangement
2011
Minimum linear arrangement is a classical basic combinatorial optimization problem...
A heuristic approach for the continuous error localization problem in data cleaning
A heuristic approach for the continuous error localization problem in data cleaning
2007
The Error Localization Problem concerns finding the minimum number of fields in a...
A branch-and-cut algorithm for the continuous error localization problem in data cleaning
A branch-and-cut algorithm for the continuous error localization problem in data cleaning
2007
Data collected by statistical agencies may contain mistakes made during the...
A unified mathematical programming framework for different statistical disclosure limitation methods
A unified mathematical programming framework for different statistical disclosure limitation methods
2005
This paper concerns statistical disclosure control methods to minimize information...
A branch-and-cut algorithm for the undirected traveling purchaser problem
A branch-and-cut algorithm for the undirected traveling purchaser problem
2003
The purpose of this paper is to present a branch-and-cut algorithm for the undirected...
Solving the asymmetric traveling purchaser problem
Solving the asymmetric traveling purchaser problem
2006
The Asymmetric Traveling Purchaser Problem (ATPP) is a generalization of the...
Laying out sparse graphs with provably minimum bandwidth
Laying out sparse graphs with provably minimum bandwidth
2005
Finding a linear layout of a graph having minimum bandwidth is a combinatorial...
The biobjective travelling purchaser problem
The biobjective travelling purchaser problem
2005
The purpose of this article is to present and solve the Biobjective Travelling...
Heuristics for the one-commodity pickup-and-delivery traveling salesman problem
Heuristics for the one-commodity pickup-and-delivery traveling salesman problem
2004
This paper deals with a generalisation of the well-known traveling salesman problem...
Mathematical models for applying cell suppression methodology in statistical data protection
Mathematical models for applying cell suppression methodology in statistical data protection
2004
This paper concerns the problem of protecting sensitive information in tabular data...
The Steiner cycle polytope
The Steiner cycle polytope
2003
This article introduces a new problem called Steiner cycle problem (SCP), closely...
Papers per page: