The following pages link to (Q4857376):
Displaying 50 items.
- 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)
- Regional service coverage modeling (Q2384882) (← links)
- The minimum weighted covering location problem with distance constraints (Q2384883) (← links)
- Dynamic supply chain design with inventory (Q2384884) (← links)
- Siting park-and-ride facilities using a multi-objective spatial optimization model (Q2384892) (← links)
- Modeling data envelopment analysis (DEA) efficient location/allocation decisions (Q2384895) (← links)
- Base station location and channel allocation in a cellular network with emergency coverage requirements (Q2387214) (← links)
- Two new algorithms for UMTS access network topology design (Q2387233) (← links)
- Voronoi diagrams with overlapping regions (Q2393120) (← links)
- A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design (Q2393466) (← links)
- Alternate risk measures for emergency medical service system design (Q2430620) (← links)
- A simultaneous inventory control and facility location model with stochastic capacity constraints (Q2432639) (← links)
- A hierarchical location model for public facility planning (Q2456408) (← links)
- A multiperiod set covering location model for dynamic redeployment of ambulances (Q2456639) (← links)
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm (Q2460125) (← links)
- A particle swarm optimization algorithm with path relinking for the location routing problem (Q2481605) (← links)
- Solving the uncapacitated facility location problem using tabu search (Q2489305) (← links)
- An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
- Exact procedures for solving the discrete ordered median problem (Q2499160) (← links)
- Finding a cluster of points and the grey pattern quadratic assignment problem (Q2507561) (← links)