Drezner Zvi

Zvi Drezner

Information about the author Zvi Drezner will soon be added to the site.
Found 112 papers in total
Compounded genetic algorithms for the quadratic assignment problem
2005
We introduce the compounded genetic algorithm. We propose to run a quick genetic...
The extended concentric tabu for the quadratic assignment problem
2005
In this paper we propose to extend the concentric tabu search for the quadratic...
The gradual covering problem
2004
In this paper we investigate the gradual covering problem. Within a certain distance...
A competitive facility location problem on a tree network with stochastic weights
2003
We consider n demand points on a tree network. Two competitive companies plan to...
The gradual covering decay location problem on a network
2003
In covering problems it is assumed that there is a critical distance within which the...
An efficient genetic algorithm for the p-median problem
2003
We propose a new genetic algorithm for a well-known facility location problem. The...
A probabilistic minimax location problem on the plane
2003
In this paper we consider the weighted minimax (1-center) location problem in the...
Locating service facilities whose reliability is distance dependent
2003
We consider the problem where there is a probability, depending on the distance from...
Solving the multiple competitive facilities location problem
2002
In this paper we propose five heuristic procedures for the solution of the multiple...
Sensitivity analysis to the value of p of the lp distance Weber problem
2002
In this paper we analyze the sensitivity of the l p distance Weber problem to the...
Validating the gravity-based competitive location model using inferred attractiveness
2002
The attractiveness of retail facilities is an essential component of models analyzing...
A new heuristic for the quadratic assignment problem
2002
We propose a new heuristic for the solution of the quadratic assignment problem. The...
Using hybrid metaheuristics for the one-way and two-way network design problem
2002
A network with traffic between nodes is known. The links of the network can be...
The collection depots location problem on networks
2002
In this paper we investigate the collection depots location problem on a network. A...
On the circle closest to a set of points
2002
The objective of this paper is to find a circle whose circumference is as close as...
Minimum covering criterion for obnoxious facility location on a network
1996
The objective of this article was to find a location of a new facility on a network so...
On the collection depots location problem
2001
In this paper we investigate the problem of locating a new facility servicing a set of...
Applying combinatorial optimization metaheuristics to the golf scramble problem
2000
One typical golf tournament format is termed a ‘Scramble’, comprised of...
Routing and location on a network with hazardous threats
2000
The aim of this paper is to minimise the impact of hazards located on or near a...
Location models with groups of demand points
2000
In this paper we investigate the location of a new facility in an area where demand is...
Quantifying the bullwhip effect in a simple supply chain: The Impact of forecasting, lead times, and information
2000
An important observation in supply chain management, known as the bullwhip effect,...
A note on the location of an obnoxious facility on a network
2000
We find the best location for an obnoxious facility on a network such that the least...
On the selection of relay points in a logistics system
1997
In this paper, we consider a location problem of relay points in a logistics system....
Various objectives for the queueing-location problem on the plane
1999
The queueing-location problem is formulated in order to find the best location for a...
Papers per page: