# Zvi Drezner

According to our database

Collaborative distances:

^{1}, Zvi Drezner authored at least 159 papers between 1980 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2021

Hierarchicity-based (self-similar) hybrid genetic algorithm for the grey pattern quadratic assignment problem.

Memetic Comput., 2021

INFOR Inf. Syst. Oper. Res., 2021

2020

OR Spectr., 2020

Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming.

Int. Trans. Oper. Res., 2020

CoRR, 2020

The Importance of Good Starting Solutions in the Minimum Sum of Squares Clustering Problem.

CoRR, 2020

CoRR, 2020

Comput. Manag. Sci., 2020

Ann. Oper. Res., 2020

2019

Oper. Res. Lett., 2019

J. Oper. Res. Soc., 2019

INFOR Inf. Syst. Oper. Res., 2019

Comput. Oper. Res., 2019

Comput. Ind. Eng., 2019

2018

Oper. Res. Lett., 2018

Comput. Oper. Res., 2018

2017

J. Oper. Res. Soc., 2017

Incorporating neighborhood reduction for the solution of the planar p-median problem.

Ann. Oper. Res., 2017

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016

Networks, 2016

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

Commun. Stat. Simul. Comput., 2016

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

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

Comput. Oper. Res., 2015

Comput. Oper. Res., 2015

Resilient gossip algorithms for collecting online management information in exascale clusters.

Concurr. Comput. Pract. Exp., 2015

2014

OR Spectr., 2014

Math. Methods Oper. Res., 2014

Eur. J. Oper. Res., 2014

Eur. J. Oper. Res., 2014

2013

OR Spectr., 2013

Math. Methods Oper. Res., 2013

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

Comput. Oper. Res., 2013

2012

J. Oper. Res. Soc., 2012

Strategic competitive location: improving existing and establishing new facilities.

J. Oper. Res. Soc., 2012

J. Oper. Res. Soc., 2012

Electron. Notes Discret. Math., 2012

2011

Networks, 2011

J. Oper. Res. Soc., 2011

J. Oper. Res. Soc., 2011

INFOR Inf. Syst. Oper. Res., 2011

Comput. Oper. Res., 2011

Normalizing variables with too-frequent values using a Kolmogorov-Smirnov test: A practical approach.

Comput. Ind. Eng., 2011

2010

Math. Methods Oper. Res., 2010

J. Oper. Res. Soc., 2010

Eur. J. Oper. Res., 2010

Commun. Stat. Simul. Comput., 2010

Comput. Oper. Res., 2010

Comput. Oper. Res., 2010

Commun. ACM, 2010

2009

J. Glob. Optim., 2009

Int. Trans. Oper. Res., 2009

Eur. J. Oper. Res., 2009

Eur. J. Oper. Res., 2009

Eur. J. Oper. Res., 2009

Eur. J. Oper. Res., 2009

Comput. Oper. Res., 2009

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

Ann. Oper. Res., 2009

Ann. Oper. Res., 2009

Ann. Oper. Res., 2009

Ann. Oper. Res., 2009

2008

Oper. Res. Lett., 2008

J. Oper. Res. Soc., 2008

J. Oper. Res. Soc., 2008

Eur. J. Oper. Res., 2008

Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem.

Comput. Oper. Res., 2008

Comput. Oper. Res., 2008

Proceedings of the Learning from the past & charting the future of the discipline. 14th Americas Conference on Information Systems, 2008

2007

J. Oper. Res. Soc., 2007

A General Global Optimization Approach for Solving Location Problems in the Plane.

J. Glob. Optim., 2007

Eur. J. Oper. Res., 2007

Eur. J. Oper. Res., 2007

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

Comput. Manag. Sci., 2007

2006

OR Spectr., 2006

A multi-objective heuristic approach for the casualty collection points location problem.

J. Oper. Res. Soc., 2006

Adv. Decis. Sci., 2006

2005

OR Spectr., 2005

Oper. Res. Lett., 2005

Int. Trans. Oper. Res., 2005

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

4OR, 2005

2004

The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems.

Oper. Res., 2004

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

J. Oper. Res. Soc., 2003

J. Oper. Res. Soc., 2003

INFORMS J. Comput., 2003

A competitive facility location problem on a tree network with stochastic weights.

Eur. J. Oper. Res., 2003

Eur. J. Oper. Res., 2003

Comput. Oper. Res., 2003

Ann. Oper. Res., 2003

Ann. Oper. Res., 2003

2002

Adv. Decis. Sci., 2002

Eur. J. Oper. Res., 2002

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

Springer, ISBN: 978-3-540-42172-6, 2002

2001

Adv. Decis. Sci., 2001

Eur. J. Oper. Res., 2001

2000

J. Oper. Res. Soc., 2000

J. Oper. Res. Soc., 2000

Eur. J. Oper. Res., 2000

1999

Adv. Decis. Sci., 1999

Adv. Decis. Sci., 1999

Eur. J. Oper. Res., 1999

Application of decision analysis techniques to the Weber facility location problem.

Eur. J. Oper. Res., 1999

Comput. Oper. Res., 1999

Comput. Oper. Res., 1999

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

Transp. Sci., 1997

Adv. Decis. Sci., 1997

1996

Networks, 1996

1995

Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming.

Oper. Res., 1995

Comput. Oper. Res., 1995

Comput. Optim. Appl., 1995

1993

ACM Trans. Math. Softw., 1993

J. Intell. Robotic Syst., 1993

1992

ACM Trans. Math. Softw., 1992

Ann. Oper. Res., 1992

Ann. Oper. Res., 1992

Ann. Oper. Res., 1992

1991

Transp. Sci., 1991

Transp. Sci., 1991

1989

Transp. Sci., 1989

Transp. Sci., 1989

1987

Math. Program., 1987

Math. Oper. Res., 1987

1986

Networks, 1986

An Asychronous Algorithm for Scattering Information between the Active Nodes of a Multicomputer System.

J. Parallel Distributed Comput., 1986

1985

Transp. Sci., 1985

0(<i>N</i> log <i>N</i>) Algorithm for the Rectilinear Round-Trip Location Problem.

Transp. Sci., 1985

Oper. Res., 1985

Layout of facilities with some fixed points.

Comput. Oper. Res., 1985

1984

Transp. Sci., 1984

1983

Oper. Res., 1983

1982

Math. Program., 1982

1981

Oper. Res., 1981

1980

SIAM J. Matrix Anal. Appl., 1980

Oper. Res., 1980

Oper. Res., 1980