Pages that link to "Item:Q4527247"
From MaRDI portal
The following pages link to Heuristic Methods for Location-Allocation Problems (Q4527247):
Displayed 50 items.
- Classical and inverse median location problems under uncertain environment (Q1987593) (← links)
- Uncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planning (Q2009241) (← links)
- The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods (Q2022209) (← links)
- Directional approach to gradual cover: the continuous case (Q2033708) (← links)
- An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
- A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods (Q2147112) (← links)
- A two-level off-grid electric distribution problem on the continuous space (Q2147125) (← links)
- Biologically inspired parent selection in genetic algorithms (Q2178305) (← links)
- A voltage drop limited decentralized electric power distribution network (Q2185525) (← links)
- The blockwise coordinate descent method for integer programs (Q2189480) (← links)
- Heuristic approaches for solid transportation-\(p\)-facility location problem (Q2201302) (← links)
- \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
- An exact and a heuristic approach for the transportation-\(p\)-facility location problem (Q2221475) (← links)
- On the convergence of the Cooper's algorithm (Q2228419) (← links)
- A new local search for continuous location problems (Q2255938) (← links)
- The location-allocation problem of drone base stations (Q2273669) (← links)
- Solving multiple facilities location problems with separated clusters (Q2294344) (← links)
- Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks (Q2295155) (← links)
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge (Q2307752) (← links)
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach (Q2318909) (← links)
- The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem (Q2327679) (← links)
- Multi-facility green Weber problem (Q2333139) (← links)
- A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces (Q2355716) (← links)
- A bibliography for some fundamental problem categories in discrete location science (Q2384836) (← links)
- Regional service coverage modeling (Q2384882) (← links)
- On strategies to fix degenerate \(k\)-means solutions (Q2403298) (← links)
- The optimal solution set of the multi-source Weber problem (Q2414188) (← links)
- A directional approach to gradual cover (Q2421326) (← links)
- The planar hub location problem: a probabilistic clustering approach (Q2449351) (← links)
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach (Q2463484) (← links)
- Biconvex sets and optimization with biconvex functions: a survey and extensions (Q2465382) (← links)
- The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory (Q2629705) (← links)
- Location of a distribution center for a perishable product (Q2636926) (← links)
- A minisum location problem with regional demand considering farthest Euclidean distances (Q2815539) (← links)
- Generating good starting solutions for the p-median problem in the plane (Q2840779) (← links)
- Improved starting solutions for the planar p-median problem (Q3388942) (← links)
- Un algorithme pour résoudre une famille de problèmes de localisation multisources (Q3713510) (← links)
- LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY (Q3964470) (← links)
- Local convergence in Fermat's problem (Q4042858) (← links)
- On the Fermat—Weber problem with convex cost functions (Q4152041) (← links)
- A historical perspective on location problems (Q4981814) (← links)
- Using injection points in reformulation local search for solving continuous location problems (Q4987696) (← links)
- The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique (Q4987796) (← links)
- Discrete facility location in machine learning (Q5100135) (← links)
- Median Problems in Networks (Q5506718) (← links)
- Continuous Center Problems (Q5506719) (← links)
- Heuristics for Location Models (Q5506730) (← links)
- Locating facilities in three‐dimensional space by convex programming (Q5589764) (← links)
- Exact and approximate solutions to the multisource weber problem (Q5657909) (← links)
- On solving unreliable planar location problems (Q5926602) (← links)