George O. Wesolowsky

According to our database1, George O. Wesolowsky authored at least 40 papers between 1971 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Maximizing the minimum cover probability by emergency facilities.
Annals OR, 2016

2012
On the use of the Varignon frame for single facility Weber problems in the presence of convex barriers.
European Journal of Operational Research, 2012

A planar single facility location and border crossing problem.
Computers & OR, 2012

2011
Planar expropriation problem with non-rigid rectangular facilities.
Computers & OR, 2011

2010
The rectilinear distance Weber problem in the presence of a probabilistic line barrier.
European Journal of Operational Research, 2010

2009
Optimizing Facility Location with Euclidean and Rectilinear Distances.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A defensive maximal covering problem on a network.
ITOR, 2009

Location with acceleration-deceleration distance.
European Journal of Operational Research, 2009

The variable radius covering problem.
European Journal of Operational Research, 2009

Optimal location with equitable loads.
Annals OR, 2009

2008
The multiple location of transfer points.
JORS, 2008

A BSSS algorithm for the single facility location problem in two regions with different norms.
European Journal of Operational Research, 2008

2007
Planar maximal covering location problem under block norm distance measure.
JORS, 2007

The transfer point location problem.
European Journal of Operational Research, 2007

The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation.
European Journal of Operational Research, 2007

2005
Maximizing cover probability by using multivariate normal distributions.
OR Spectrum, 2005

The facility and transfer points location problem.
ITOR, 2005

2004
A mixed integer formulation for maximal covering by inclined parallelograms.
European Journal of Operational Research, 2004

2003
The expropriation location problem.
JORS, 2003

Locating service facilities whose reliability is distance dependent.
Computers & OR, 2003

Location Among Regions with Varying Norms.
Annals OR, 2003

A Probabilistic Minimax Location Problem on the Plane.
Annals OR, 2003

2002
On the circle closest to a set of points.
Computers & OR, 2002

Locating facilities by minimax relative to closest points of demand areas.
Computers & OR, 2002

Sensitivity Analysis to the Value of p of the lp Distance Weber Problem.
Annals OR, 2002

Minisum Location with Closest Euclidean Distances.
Annals OR, 2002

2001
On the collection depots location problem.
European Journal of Operational Research, 2001

1999
Allocation of discrete demand with changing costs.
Computers & OR, 1999

Allocation of demand when cost is demand-dependent.
Computers & OR, 1999

1998
The plant location problem with demand-dependent setup costs and centralized allocation.
European Journal of Operational Research, 1998

1997
Selecting an Optimum Configuration of One-Way and Two-Way Routes.
Transportation Science, 1997

1996
Minimum covering criterion for obnoxious facility location on a network.
Networks, 1996

1992
Probabilisticlp distances in location models.
Annals OR, 1992

1991
The Facility Location Problem with Limited Distances.
Transportation Science, 1991

1989
The Asymmetric Distance Location Problem.
Transportation Science, 1989

1985
Location of Multiple Obnoxious Facilities.
Transportation Science, 1985

Layout of facilities with some fixed points.
Computers & OR, 1985

1980
Single Facility lp-Distance Minimax Location.
SIAM J. Matrix Analysis Applications, 1980

The Expected Value of Perfect Information in Facility Location.
Operations Research, 1980

1971
Technical Note - The Optimal Location of New Facilities Using Rectangular Distances.
Operations Research, 1971


  Loading...