Pages that link to "Item:Q1197648"
From MaRDI portal
The following pages link to An optimal method for solving the (generalized) multi-Weber problem (Q1197648):
Displaying 40 items.
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem (Q262934) (← links)
- New local searches for solving the multi-source Weber problem (Q512988) (← links)
- An agent-based framework for modeling and solving location problems (Q610998) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand (Q709182) (← links)
- The multi-facility min-max Weber problem (Q795710) (← links)
- The multi-facility location-allocation problem with polyhedral barriers (Q960384) (← links)
- A generalized Weiszfeld method for the multi-facility location problem (Q974995) (← links)
- Multi-source facility location-allocation and inventory problem (Q992677) (← links)
- A branch-and-price algorithm for the multi-source Weber problem (Q1000170) (← links)
- Allocation search methods for a generalized class of location-allocation problems (Q1011223) (← links)
- Solving probabilistic multi-facility Weber problem by vector quantization (Q1027991) (← links)
- An optimal method for solving the (generalized) multi-Weber problem (Q1197648) (← links)
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem (Q1271380) (← links)
- Weber problems with alternative transportation systems (Q1278584) (← links)
- Kohonen maps for solving a class of location-allocation problems (Q1296007) (← links)
- Stabilized column generation (Q1297485) (← links)
- A projection method for \(l_ p\) norm location-allocation problems (Q1337136) (← links)
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre (Q1348705) (← links)
- Two algorithms for the multi-Weber problem (Q1417702) (← links)
- A cellular heuristic for the multisource Weber problem. (Q1422355) (← links)
- A two-echelon joint continuous-discrete location model (Q1683143) (← links)
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
- A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
- \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
- A new local search for continuous location problems (Q2255938) (← links)
- Multi-facility green Weber problem (Q2333139) (← links)
- The optimal solution set of the multi-source Weber problem (Q2414188) (← links)
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach (Q2463484) (← links)
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem (Q2679571) (← links)
- On the Set of Optimal Points to the Weber Problem (Q3971847) (← links)
- (Q4721061) (← links)
- (Q4763632) (← links)
- Conflict-tolerant and conflict-free multi-agent meeting (Q6136090) (← links)
- (Q6160407) (← links)
- A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification (Q6164583) (← links)
- Solving net-constrained clustering problem (Q6668165) (← links)