default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge O. Wesolowsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j40]Zvi Drezner, Vladimir Marianov
, George O. Wesolowsky:
Maximizing the minimum cover probability by emergency facilities. Ann. Oper. Res. 246(1-2): 349-362 (2016)- 2012
- [j39]Mustafa S. Canbolat, George O. Wesolowsky:
A planar single facility location and border crossing problem. Comput. Oper. Res. 39(12): 3156-3165 (2012) - [j38]Mustafa S. Canbolat, George O. Wesolowsky:
On the use of the Varignon frame for single facility Weber problems in the presence of convex barriers. Eur. J. Oper. Res. 217(2): 241-247 (2012) - 2011
- [j37]Ozan Çakir, George O. Wesolowsky:
Planar expropriation problem with non-rigid rectangular facilities. Comput. Oper. Res. 38(1): 75-89 (2011) - 2010
- [j36]Mustafa S. Canbolat, George O. Wesolowsky:
The rectilinear distance Weber problem in the presence of a probabilistic line barrier. Eur. J. Oper. Res. 202(1): 114-121 (2010) - 2009
- [j35]Oded Berman, Zvi Drezner, Arie Tamir, George O. Wesolowsky:
Optimal location with equitable loads. Ann. Oper. Res. 167(1): 307-325 (2009) - [j34]Oded Berman, Zvi Drezner, Dmitry Krass, George O. Wesolowsky:
The variable radius covering problem. Eur. J. Oper. Res. 196(2): 516-525 (2009) - [j33]Zvi Drezner, Tammy Drezner, George O. Wesolowsky:
Location with acceleration-deceleration distance. Eur. J. Oper. Res. 198(1): 157-164 (2009) - [j32]Oded Berman, Tammy Drezner, Zvi Drezner, George O. Wesolowsky:
A defensive maximal covering problem on a network. Int. Trans. Oper. Res. 16(1): 69-86 (2009) - 2008
- [j31]Mehdi Zaferanieh, Hossein Taghizadeh Kakhki, Jack Brimberg, George O. Wesolowsky:
A BSSS algorithm for the single facility location problem in two regions with different norms. Eur. J. Oper. Res. 190(1): 79-89 (2008) - [j30]Oded Berman, Zvi Drezner, George O. Wesolowsky:
The multiple location of transfer points. J. Oper. Res. Soc. 59(6): 805-811 (2008) - 2007
- [j29]Igor Averbakh, Oded Berman, Zvi Drezner, George O. Wesolowsky:
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation. Eur. J. Oper. Res. 179(3): 956-967 (2007) - [j28]Oded Berman, Zvi Drezner, George O. Wesolowsky:
The transfer point location problem. Eur. J. Oper. Res. 179(3): 978-989 (2007) - [j27]Hassan Younies, George O. Wesolowsky:
Planar maximal covering location problem under block norm distance measure. J. Oper. Res. Soc. 58(6): 740-750 (2007) - 2005
- [j26]Oded Berman, Zvi Drezner, George O. Wesolowsky:
The facility and transfer points location problem. Int. Trans. Oper. Res. 12(4): 387-402 (2005) - [j25]Zvi Drezner, George O. Wesolowsky:
Maximizing cover probability by using multivariate normal distributions. OR Spectr. 27(1): 95-106 (2005) - 2004
- [j24]Hassan Younies, George O. Wesolowsky:
A mixed integer formulation for maximal covering by inclined parallelograms. Eur. J. Oper. Res. 159(1): 83-94 (2004) - 2003
- [j23]Oded Berman, Jiamin Wang, Zvi Drezner, George O. Wesolowsky:
A Probabilistic Minimax Location Problem on the Plane. Ann. Oper. Res. 122(1-4): 59-70 (2003) - [j22]Jack Brimberg, Hossein Taghizadeh Kakhki, George O. Wesolowsky:
Location Among Regions with Varying Norms. Ann. Oper. Res. 122(1-4): 87-102 (2003) - [j21]Oded Berman, Zvi Drezner, George O. Wesolowsky:
Locating service facilities whose reliability is distance dependent. Comput. Oper. Res. 30(11): 1683-1695 (2003) - [j20]Oded Berman, Zvi Drezner, George O. Wesolowsky:
The expropriation location problem. J. Oper. Res. Soc. 54(7): 769-776 (2003) - 2002
- [j19]Zvi Drezner, George O. Wesolowsky:
Sensitivity Analysis to the Value of p of the lp Distance Weber Problem. Ann. Oper. Res. 111(1-4): 135-150 (2002) - [j18]Jack Brimberg, George O. Wesolowsky:
Minisum Location with Closest Euclidean Distances. Ann. Oper. Res. 111(1-4): 151-165 (2002) - [j17]Jack Brimberg, George O. Wesolowsky:
Locating facilities by minimax relative to closest points of demand areas. Comput. Oper. Res. 29(6): 625-636 (2002) - [j16]Zvi Drezner, Stefan H. Steiner, George O. Wesolowsky:
On the circle closest to a set of points. Comput. Oper. Res. 29(6): 637-650 (2002) - 2001
- [j15]Zvi Drezner, George O. Wesolowsky:
On the collection depots location problem. Eur. J. Oper. Res. 130(3): 510-518 (2001) - 2000
- [j14]Oded Berman, Zvi Drezner, George O. Wesolowsky:
Routing and location on a network with hazardous threats. J. Oper. Res. Soc. 51(9): 1093-1099 (2000) - 1999
- [j13]Zvi Drezner, George O. Wesolowsky:
Allocation of demand when cost is demand-dependent. Comput. Oper. Res. 26(1): 1-15 (1999) - [j12]Zvi Drezner, George O. Wesolowsky:
Allocation of discrete demand with changing costs. Comput. Oper. Res. 26(14): 1335-1349 (1999) - 1998
- [j11]Igor Averbakh, Oded Berman, Zvi Drezner, George O. Wesolowsky:
The plant location problem with demand-dependent setup costs and centralized allocation. Eur. J. Oper. Res. 111(3): 543-554 (1998) - 1997
- [j10]Zvi Drezner, George O. Wesolowsky:
Selecting an Optimum Configuration of One-Way and Two-Way Routes. Transp. Sci. 31(4): 386-394 (1997) - 1996
- [j9]Oded Berman, Zvi Drezner, George O. Wesolowsky:
Minimum covering criterion for obnoxious facility location on a network. Networks 28(1): 1-5 (1996) - 1992
- [j8]Jack Brimberg, George O. Wesolowsky:
Probabilisticlp distances in location models. Ann. Oper. Res. 40(1): 67-75 (1992) - 1991
- [j7]Zvi Drezner, Avram Mehrez, George O. Wesolowsky:
The Facility Location Problem with Limited Distances. Transp. Sci. 25(3): 183-187 (1991) - 1989
- [j6]Zvi Drezner, George O. Wesolowsky:
The Asymmetric Distance Location Problem. Transp. Sci. 23(3): 201-207 (1989) - 1985
- [j5]Zvi Drezner, George O. Wesolowsky:
Layout of facilities with some fixed points. Comput. Oper. Res. 12(6): 603-610 (1985) - [j4]Zvi Drezner, George O. Wesolowsky:
Location of Multiple Obnoxious Facilities. Transp. Sci. 19(3): 193-202 (1985) - 1980
- [j3]Zvi Drezner, George O. Wesolowsky:
The Expected Value of Perfect Information in Facility Location. Oper. Res. 28(2): 395-402 (1980) - [j2]Zvi Drezner, George O. Wesolowsky:
Single Facility lp-Distance Minimax Location. SIAM J. Algebraic Discret. Methods 1(3): 315-321 (1980) - 1971
- [j1]George O. Wesolowsky, Robert F. Love:
Technical Note - The Optimal Location of New Facilities Using Rectangular Distances. Oper. Res. 19(1): 124-130 (1971)
Reference Works
- 2009
- [r1]Jack Brimberg, George O. Wesolowsky:
Optimizing Facility Location with Euclidean and Rectilinear Distances. Encyclopedia of Optimization 2009: 2869-2873
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
