The following pages link to George O. Wesolowsky (Q190042):
Displaying 50 items.
- Covering part of a planar network (Q291695) (← links)
- A planar single facility location and border crossing problem (Q339663) (← links)
- On the use of the varignon frame for single facility Weber problems in the presence of convex barriers (Q439364) (← links)
- Maximizing the minimum cover probability by emergency facilities (Q512997) (← links)
- Planar expropriation problem with non-rigid rectangular facilities (Q709112) (← links)
- (Q794919) (redirect page) (← links)
- Multi-stage production with variable lot sizes and transportation of partial lots (Q794920) (← links)
- The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation (Q864015) (← links)
- The transfer point location problem (Q864017) (← links)
- Optimal location with equitable loads (Q1026600) (← links)
- The variable radius covering problem (Q1027534) (← links)
- Location with acceleration-deceleration distance (Q1027601) (← links)
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier (Q1038385) (← links)
- Layout of facilities with some fixed points (Q1086124) (← links)
- Multi-buyer discount pricing (Q1117816) (← links)
- Location-allocation on a line with demand-dependent costs (Q1268427) (← links)
- Allocation of demand when cost is demand-dependent (Q1302705) (← links)
- A probabilistic minimax location problem on the plane (Q1413749) (← links)
- Location among regions with varying norms (Q1413752) (← links)
- Locating service facilities whose reliability is distance dependent. (Q1422360) (← links)
- Maximizing cover probability by using multivariate normal distributions (Q1764210) (← links)
- The plant location problem with demand-dependent setup costs and centralized allocation (Q1806866) (← links)
- Allocation of discrete demand with changing costs (Q1819240) (← links)
- Sensitivity analysis to the value of \(p\) of the \({\ell}_p\) distance Weber problem (Q1872031) (← links)
- A mixed integer formulation for maximal covering by inclined parallelograms (Q1876161) (← links)
- Location of an Obnoxious Route (Q3033533) (← links)
- (Q3147656) (← links)
- Routing and location on a network with hazardous threats (Q3156649) (← links)
- The gradual covering problem (Q3156756) (← links)
- Minimax and maximin facility location problems on a sphere (Q3320094) (← links)
- The Weber Problem On The Plane With Some Negative Weights (Q3362085) (← links)
- The facility and transfer points location problem (Q3410164) (← links)
- An approximation method for bivariate and multvariate normal equiprobability contours (Q3473023) (← links)
- Location of Multiple Obnoxious Facilities (Q3748029) (← links)
- Control limits for a drifting process with quadratic loss (Q3809572) (← links)
- Facility Location on a Sphere (Q3863653) (← links)
- The Expected Value of Perfect Information in Facility Location (Q3863654) (← links)
- A Trajectory Method for the Optimization of the Multi-Facility Location Problem With <i>lp</i> Distances (Q3953533) (← links)
- Single Facility $l_p $-Distance Minimax Location (Q3967330) (← links)
- Optimizing control limits under random process shifts and a quadratic penalty function (Q3983732) (← links)
- Facility location when demand is time dependent (Q3987788) (← links)
- The Facility Location Problem with Limited Distances (Q3988705) (← links)
- The Multiperiod Location-Allocation Problem with Relocation of Facilities (Q4068482) (← links)
- Probabilistic Weights in the One-Dimensional Facility Location Problem (Q4149201) (← links)
- A New Method for the Multifacility Minimax Location Problem (Q4170553) (← links)
- (Q4203976) (← links)
- (Q4229604) (← links)
- (Q4229625) (← links)
- Selecting an Optimum Configuration of One-Way and Two-Way Routes (Q4233782) (← links)
- (Q4359750) (← links)
