The following pages link to Richard L. Church (Q238088):
Displaying 36 items.
- The disruptive anti-covering location problem (Q320083) (← links)
- Designing robust coverage networks to hedge against worst-case facility losses (Q617512) (← links)
- Concurrent optimization of harvesting and road network layouts under steep terrain (Q748552) (← links)
- A heuristic for a hybrid FLEET model (Q911981) (← links)
- Facets for node packing (Q1278997) (← links)
- Analyzing tradeoffs between zonal constraints and accessibility in facility location (Q1317094) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- COBRA: A new formulation of the classic \(p\)-median location problem (Q1413753) (← links)
- Forest management models and combinatorial algorithms: Analysis of state of the art (Q1593541) (← links)
- Forest planning at the tactical level (Q1593581) (← links)
- Location covering models. History, applications and advancements (Q1755145) (← links)
- Heuristic solution approaches to operational forest planning problems (Q1909009) (← links)
- The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
- Support system development for forest ecosystem management (Q1969854) (← links)
- Service allocation equity in location coverage analytics (Q2083924) (← links)
- Extensions to the Weber problem (Q2147049) (← links)
- Single facility siting involving allocation decisions (Q2178111) (← links)
- Regional service coverage modeling (Q2384882) (← links)
- BEAMR: an exact and approximate model for the \(p\)-median problem (Q2384887) (← links)
- A bilevel mixed-integer program for critical infrastructure protection planning (Q2462537) (← links)
- An exact solution approach for the interdiction median problem with fortification (Q2477666) (← links)
- A GRASP and path relinking heuristic for rural road network development (Q2573003) (← links)
- On the unified dispersion problem: efficient formulations and exact algorithms (Q2629707) (← links)
- Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
- Review of obnoxious facilities location problems (Q2669654) (← links)
- On a bi-level formulation to protect uncapacitated p-median systems with facility recovery time and frequent disruptions (Q2883619) (← links)
- The Nested Hierarchical Median Facility Location Model (Q3359993) (← links)
- Closest assignment constraints and location models: Properties and structure (Q4228769) (← links)
- (Q4265884) (← links)
- Maximal covering tree problems (Q4695786) (← links)
- A Fast, Network-based, Hybrid Heuristic for the Assignment of Students to Schools (Q4735023) (← links)
- (Q5447019) (← links)
- Constructing And Selecting Adjacency Constraints (Q5689643) (← links)
- Geographical information systems and location science (Q5959381) (← links)
- Spatial optimization of multiple area land acquisition (Q6164366) (← links)
- Extensions to the planar \(p\)-median problem (Q6165390) (← links)
