The following pages link to (Q4857376):
Displayed 50 items.
- Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion (Q1847216) (← links)
- Solving the multiple competitive facilities location problem (Q1847246) (← links)
- Selecting hierarchical facilities in a service-operations environment (Q1873008) (← links)
- Maximal covering code multiplexing access telecommunication networks (Q1876173) (← links)
- A maximal covering location model in the presence of partial coverage (Q1881656) (← links)
- Implementing a mathematical model for locating EMS vehicles in Fayetteville, NC (Q1881662) (← links)
- Cost-optimal topology planning of hierarchical access networks (Q1886727) (← links)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
- Optimizing the supply chain configuration for make-to-order manufacturing (Q1926828) (← links)
- Integer linear programming models for grid-based light post location problem (Q1926907) (← links)
- A continuous approximation approach for the integrated facility-inventory allocation problem (Q1926929) (← links)
- Covering models and optimization techniques for emergency response facility location and planning: a review (Q1935907) (← links)
- Does Euclidean distance work well when the \(p\)-median model is applied in rural areas? (Q1945072) (← links)
- Designing a supply chain network under the risk of disruptions (Q1954554) (← links)
- Design of a multiobjective reverse logistics network considering the cost and service level (Q1955359) (← links)
- A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem (Q1955409) (← links)
- ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem (Q1959176) (← links)
- The stratified \(p\)-center problem (Q2003436) (← links)
- Maximizing expected coverage of flow and opportunity for diversion in networked systems (Q2005813) (← links)
- Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization (Q2030665) (← links)
- An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
- Robustness of solutions to the capacitated facility location problem with uncertain demand (Q2091221) (← links)
- 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem (Q2102848) (← links)
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
- Solving the absolute 1-center problem in the quickest path case (Q2119314) (← links)
- The effect of optimizing warehouse locations on omnichannel designs (Q2140207) (← links)
- Optimizing location of manufacturing industries in the context of economic globalization: a bi-level model based approach (Q2150554) (← links)
- Sustainable capacitated facility location/network design problem: a non-dominated sorting genetic algorithm based multiobjective approach (Q2150757) (← links)
- A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption (Q2183874) (← links)
- A robust \(p\)-center problem under pressure to locate shelters in wildfire context (Q2195562) (← links)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
- RAMP algorithms for the capacitated facility location problem (Q2240709) (← links)
- The obnoxious facilities planar \(p\)-median problem (Q2241906) (← links)
- A modified variable neighborhood search for the discrete ordered median problem (Q2256171) (← links)
- A dual bounding scheme for a territory design problem (Q2257364) (← links)
- An efficient model formulation for level of repair analysis (Q2267298) (← links)
- Algorithms for the design of network topologies with balanced disjoint rings (Q2267818) (← links)
- Designing a two-echelon distribution network under demand uncertainty (Q2272305) (← links)
- Solving multiple facilities location problems with separated clusters (Q2294344) (← links)
- Improving fairness in ambulance planning by time sharing (Q2327642) (← links)
- Considering short-term and long-term uncertainties in location and capacity planning of public healthcare facilities (Q2329491) (← links)
- An approximation algorithm for the facility location problem with lexicographic minimax objective (Q2336537) (← links)
- Distance measure and the \(p\)-median problem in rural areas (Q2341206) (← links)
- Optimal replenishment order placement in a finite time horizon (Q2342144) (← links)
- Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management (Q2355922) (← links)
- Distribution network design for fixed lifetime perishable products: a model and solution approach (Q2375708) (← links)
- The minimum equitable radius location problem with continuous demand (Q2378371) (← links)
- An extended covering model for flexible discrete and equity location problems (Q2379187) (← links)
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example (Q2379867) (← links)
- A bibliography for some fundamental problem categories in discrete location science (Q2384836) (← links)