According to our database
1,
Zvi Drezner
authored at least 180 papers
between 1980 and 2025.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2025
Reviewing extensions and solution methods of the planar Weber single facility location problem.
Comput. Oper. Res., 2025
2024
Stochastic location models applied to multipurpose shopping trips.
J. Oper. Res. Soc., August, 2024
A refinement of the gravity model for competitive facility location.
Comput. Manag. Sci., June, 2024
On the combined inverse-square effect of multiple points in multidimensional space.
Oper. Res. Lett., 2024
Competitive location models: A review.
Eur. J. Oper. Res., 2024
Different formulations of the gray pattern problem and their optimal solutions.
Eur. J. Oper. Res., 2024
Dispersed starting solutions in facility location: The case of the planar p-median problem.
Comput. Oper. Res., 2024
2023
An Efficient Heuristic for the k-Partitioning Problem.
Oper. Res. Forum, December, 2023
Competitive facility location under attrition.
Comput. Manag. Sci., December, 2023
A trajectory based heuristic for the planar p-median problem.
Comput. Oper. Res., October, 2023
Extensions to the planar p-median problem.
Ann. Oper. Res., July, 2023
The repeated <i>p</i>-dispersion problem.
INFOR Inf. Syst. Oper. Res., May, 2023
Multipurpose shopping trips and location.
Ann. Oper. Res., February, 2023
2022
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location.
Optim. Lett., 2022
Finding optimal solutions to several gray pattern instances.
Optim. Lett., 2022
Multiple obnoxious facilities with weighted demand points.
J. Oper. Res. Soc., 2022
An extension of the gravity model.
J. Oper. Res. Soc., 2022
Extensions to the Weber problem.
Comput. Oper. Res., 2022
Review of obnoxious facilities location problems.
Comput. Oper. Res., 2022
2021
The obnoxious facilities planar p-median problem.
OR Spectr., 2021
Hierarchicity-based (self-similar) hybrid genetic algorithm for the grey pattern quadratic assignment problem.
Memetic Comput., 2021
Asymmetric distance location model.
INFOR Inf. Syst. Oper. Res., 2021
Directional approach to gradual cover: the continuous case.
Comput. Manag. Sci., 2021
2020
Gradual cover competitive facility location.
OR Spectr., 2020
Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming.
Int. Trans. Oper. Res., 2020
Multiple obnoxious facilities location: A cooperative model.
IISE Trans., 2020
Obnoxious facility location: the case of weighted demand points.
CoRR, 2020
The Importance of Good Starting Solutions in the Minimum Sum of Squares Clustering Problem.
CoRR, 2020
Directional approach to gradual cover: a maximin objective.
Comput. Manag. Sci., 2020
Biologically Inspired Parent Selection in Genetic Algorithms.
Ann. Oper. Res., 2020
2019
Solving multiple facilities location problems with separated clusters.
Oper. Res. Lett., 2019
The multiple gradual cover location problem.
J. Oper. Res. Soc., 2019
Taking advantage of symmetry in some quadratic assignment problems.
INFOR Inf. Syst. Oper. Res., 2019
The planar multifacility collection depots location problem.
Comput. Oper. Res., 2019
Locating multiple facilities using the max-sum objective.
Comput. Ind. Eng., 2019
2018
Competitive facility location with random attractiveness.
Oper. Res. Lett., 2018
The Weber obnoxious facility location model: A Big Arc Small Arc approach.
Comput. Oper. Res., 2018
2017
The continuous grey pattern problem.
J. Oper. Res. Soc., 2017
Incorporating neighborhood reduction for the solution of the planar p-median problem.
Ann. Oper. Res., 2017
Corrected Gossip Algorithms for Fast Reliable Broadcast on Unreliable Systems.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017
2016
Mixed planar and network single-facility location problems.
Networks, 2016
The multiple markets competitive location problem.
Kybernetes, 2016
Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p-centre problems.
J. Heuristics, 2016
Democratic elections and centralized decisions: Condorcet and Approval Voting compared with Median and Coverage locations.
Eur. J. Oper. Res., 2016
A Simple and Effective Discretization of a Continuous Random Variable.
Commun. Stat. Simul. Comput., 2016
Maximizing the minimum cover probability by emergency facilities.
Ann. Oper. Res., 2016
The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution.
Ann. Oper. Res., 2016
Sequential location of two facilities: comparing random to optimal location of the first facility.
Ann. Oper. Res., 2016
New local searches for solving the multi-source Weber problem.
Ann. Oper. Res., 2016
2015
Exact algorithms for the solution of the grey pattern quadratic assignment problem.
Math. Methods Oper. Res., 2015
Solving the planar p-median problem by variable neighborhood and concentric searches.
J. Glob. Optim., 2015
A leader-follower model for discrete competitive facility location.
Comput. Oper. Res., 2015
New heuristic algorithms for solving the planar p-median problem.
Comput. Oper. Res., 2015
Resilient gossip algorithms for collecting online management information in exascale clusters.
Concurr. Comput. Pract. Exp., 2015
2014
The maximin gradual cover location problem.
OR Spectr., 2014
Fitting concentric circles to measurements.
Math. Methods Oper. Res., 2014
The Quintile Share Ratio in location analysis.
Eur. J. Oper. Res., 2014
A new local search for continuous location problems.
Eur. J. Oper. Res., 2014
2013
Voronoi diagrams with overlapping regions.
OR Spectr., 2013
Location of a distribution center for a perishable product.
Math. Methods Oper. Res., 2013
Solving planar location problems by global optimization.
Logist. Res., 2013
Continuous covering and cooperative covering problems with a general decay function on networks.
J. Oper. Res. Soc., 2013
Enhancing the performance of hybrid genetic algorithms by differential improvement.
Comput. Oper. Res., 2013
A new heuristic for solving the p-median problem in the plane.
Comput. Oper. Res., 2013
2012
Stochastic analysis of ordered median problems.
J. Oper. Res. Soc., 2012
Strategic competitive location: improving existing and establishing new facilities.
J. Oper. Res. Soc., 2012
Modelling lost demand in competitive facility location.
J. Oper. Res. Soc., 2012
Generating good starting solutions for the p-median problem in the plane.
Electron. Notes Discret. Math., 2012
2011
Big segment small segment global optimization algorithm on networks.
Networks, 2011
A cover-based competitive location model.
J. Oper. Res. Soc., 2011
Discrete cooperative covering problems.
J. Oper. Res. Soc., 2011
The Weber Location Problem: The Threshold Objective.
INFOR Inf. Syst. Oper. Res., 2011
The gravity multiple server location problem.
Comput. Oper. Res., 2011
Normalizing variables with too-frequent values using a Kolmogorov-Smirnov test: A practical approach.
Comput. Ind. Eng., 2011
2010
On the unboundedness of facility layout problems.
Math. Methods Oper. Res., 2010
Covering continuous demand in the plane.
J. Oper. Res. Soc., 2010
On solving the planar k-centrum problem with Euclidean distances.
Eur. J. Oper. Res., 2010
A Modified Kolmogorov-Smirnov Test for Normality.
Commun. Stat. Simul. Comput., 2010
Solving scheduling and location problems in the plane simultaneously.
Comput. Oper. Res., 2010
Generalized coverage: New developments in covering location models.
Comput. Oper. Res., 2010
Technical opinion - Random selection from a stream of events.
Commun. ACM, 2010
2009
Constructing a DC decomposition for ordered median problems.
J. Glob. Optim., 2009
A defensive maximal covering problem on a network.
Int. Trans. Oper. Res., 2009
The minimum equitable radius location problem with continuous demand.
Eur. J. Oper. Res., 2009
Solving the ordered one-median problem in the plane.
Eur. J. Oper. Res., 2009
Location with acceleration-deceleration distance.
Eur. J. Oper. Res., 2009
The variable radius covering problem.
Eur. J. Oper. Res., 2009
Location of a facility minimizing nuisance to or from a planar network.
Comput. Oper. Res., 2009
Equitable service by a facility: Minimizing the Gini coefficient.
Comput. Oper. Res., 2009
Randomized gossip algorithms for maintaining a distributed bulletin board with guaranteed age properties.
Concurr. Comput. Pract. Exp., 2009
Single facility location and relocation problem with time dependent weights and discrete planning horizon.
Ann. Oper. Res., 2009
On the convergence of the generalized Weiszfeld algorithm.
Ann. Oper. Res., 2009
Optimal location with equitable loads.
Ann. Oper. Res., 2009
The multiple server center location problem.
Ann. Oper. Res., 2009
2008
A new formulation for the conditional p-median and p-center problems.
Oper. Res. Lett., 2008
Lost demand in a competitive environment.
J. Oper. Res. Soc., 2008
The multiple location of transfer points.
J. Oper. Res. Soc., 2008
The p-median problem under uncertainty.
Eur. J. Oper. Res., 2008
Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem.
Comput. Oper. Res., 2008
New trends in locational analysis.
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
Comput. Oper. Res., 2008
Locating Base Stations for Mobile Servers.
Proceedings of the Learning from the past & charting the future of the discipline. 14th Americas Conference on Information Systems, 2008
2007
The multiple server location problem.
J. Oper. Res. Soc., 2007
A General Global Optimization Approach for Solving Location Problems in the Plane.
J. Glob. Optim., 2007
A distribution map for the one-median location problem on a network.
Eur. J. Oper. Res., 2007
The transfer point location problem.
Eur. J. Oper. Res., 2007
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation.
Eur. J. Oper. Res., 2007
Equity Models in Planar Location.
Comput. Manag. Sci., 2007
2006
Finding a cluster of points and the grey pattern quadratic assignment problem.
OR Spectr., 2006
A multi-objective heuristic approach for the casualty collection points location problem.
J. Oper. Res. Soc., 2006
Mapping the convergence of genetic algorithms.
Adv. Decis. Sci., 2006
2005
Maximizing cover probability by using multivariate normal distributions.
OR Spectr., 2005
Compounded genetic algorithms for the quadratic assignment problem.
Oper. Res. Lett., 2005
The facility and transfer points location problem.
Int. Trans. Oper. Res., 2005
The extended concentric tabu for the quadratic assignment problem.
Eur. J. Oper. Res., 2005
Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods.
Ann. Oper. Res., 2005
A distance based rule for removing population members in genetic algorithms.
4OR, 2005
2004
The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems.
Oper. Res., 2004
Finding the optimal solution to the Huff based competitive location model.
Comput. Manag. Sci., 2004
Gossip-Based Distributed Algorithms for Estimating the Average Load of Scalable Clusters and Grids.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004
2003
The expropriation location problem.
J. Oper. Res. Soc., 2003
A probabilistic one-centre location problem on a network.
J. Oper. Res. Soc., 2003
A New Genetic Algorithm for the Quadratic Assignment Problem.
INFORMS J. Comput., 2003
A competitive facility location problem on a tree network with stochastic weights.
Eur. J. Oper. Res., 2003
The gradual covering decay location problem on a network.
Eur. J. Oper. Res., 2003
Locating service facilities whose reliability is distance dependent.
Comput. Oper. Res., 2003
A Probabilistic Minimax Location Problem on the Plane.
Ann. Oper. Res., 2003
An Efficient Genetic Algorithm for the <i>p</i>-Median Problem.
Ann. Oper. Res., 2003
2002
A new heuristic for the quadratic assignment problem.
Adv. Decis. Sci., 2002
Solving the multiple competitive facilities location problem.
Eur. J. Oper. Res., 2002
On the circle closest to a set of points.
Comput. Oper. Res., 2002
Sensitivity Analysis to the Value of <i>p</i> of the <i>l</i><sub><i>p</i></sub> Distance Weber Problem.
Ann. Oper. Res., 2002
Validating the Gravity-Based Competitive Location Model Using Inferred Attractiveness.
Ann. Oper. Res., 2002
Facility location - applications and theory.
Springer, ISBN: 978-3-540-42172-6, 2002
2001
Financial applications of a Tabu search variable selection model.
Adv. Decis. Sci., 2001
On the collection depots location problem.
Eur. J. Oper. Res., 2001
2000
Deterministic hierarchical substitution inventory models.
J. Oper. Res. Soc., 2000
Routing and location on a network with hazardous threats.
J. Oper. Res. Soc., 2000
A note on the location of an obnoxious facility on a network.
Eur. J. Oper. Res., 2000
1999
The videotape rental model.
Adv. Decis. Sci., 1999
On a queue with correlated arrivals.
Adv. Decis. Sci., 1999
On the feasible set for the squared Euclidean Weber problem and applications.
Eur. J. Oper. Res., 1999
Application of decision analysis techniques to the Weber facility location problem.
Eur. J. Oper. Res., 1999
On the selection of hub airports for an airline hub-and-spoke system.
Comput. Oper. Res., 1999
Allocation of discrete demand with changing costs.
Comput. Oper. Res., 1999
Allocation of demand when cost is demand-dependent.
Comput. Oper. Res., 1999
1998
Classroom Note: A note on calculating steady state results for an M/M/k queuing system when the ratio of the arrival rate to the service rate is large.
Adv. Decis. Sci., 1998
The plant location problem with demand-dependent setup costs and centralized allocation.
Eur. J. Oper. Res., 1998
1997
Selecting an Optimum Configuration of One-Way and Two-Way Routes.
Transp. Sci., 1997
On the significance level of the multirelation coefficient.
Adv. Decis. Sci., 1997
1996
Minimum covering criterion for obnoxious facility location on a network.
Networks, 1996
1995
Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming.
Oper. Res., 1995
On the conditional <i>p</i>-median problem.
Comput. Oper. Res., 1995
Lower bounds based on linear programming for the quadratic assignment problem.
Comput. Optim. Appl., 1995
1993
Corrigendum: Algorithm 725: Computation of the multivariate normal integral.
ACM Trans. Math. Softw., 1993
The multiple-robot assembly plan problem.
J. Intell. Robotic Syst., 1993
1992
Computation of the multivariate normal integral.
ACM Trans. Math. Softw., 1992
Competitive location in the plane.
Ann. Oper. Res., 1992
Asymptotic behavior of the Weber location problem on the plane.
Ann. Oper. Res., 1992
A note on the Weber location problem.
Ann. Oper. Res., 1992
1991
The Facility Location Problem with Limited Distances.
Transp. Sci., 1991
On the Set of Optimal Points to the Weber Problem.
Transp. Sci., 1991
1989
The Asymmetric Distance Location Problem.
Transp. Sci., 1989
Conditional <i>p</i>-Center Problems.
Transp. Sci., 1989
1987
On the complexity of the exchange algorithm for minimax optimization problems.
Math. Program., 1987
On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem.
Math. Oper. Res., 1987
1986
On the number of active nodes in a multicomputer system.
Networks, 1986
An Asychronous Algorithm for Scattering Information between the Active Nodes of a Multicomputer System.
J. Parallel Distributed Comput., 1986
1985
Location of Multiple Obnoxious Facilities.
Transp. Sci., 1985
0(<i>N</i> log <i>N</i>) Algorithm for the Rectilinear Round-Trip Location Problem.
Transp. Sci., 1985
ε-Approximations for Multidimensional Weighted Location Problems.
Oper. Res., 1985
Layout of facilities with some fixed points.
Comput. Oper. Res., 1985
1984
The Planar Two-Center and Two-Median Problems.
Transp. Sci., 1984
1983
Technical Note - The Nested Ball Principle for the Relaxation Method.
Oper. Res., 1983
1982
On minimax optimization problems.
Math. Program., 1982
1981
Technical Note - On Location Dominance on Spherical Surfaces.
Oper. Res., 1981
1980
Single Facility l<sub>p</sub>-Distance Minimax Location.
SIAM J. Algebraic Discret. Methods, 1980
The Expected Value of Perfect Information in Facility Location.
Oper. Res., 1980
DISCON: A New Method for the Layout Problem.
Oper. Res., 1980
