Pages that link to "Item:Q337239"
From MaRDI portal
The following pages link to A local search heuristic for the \((r| p)\)-centroid problem in the plane (Q337239):
Displaying 16 items.
- On the complexity of the \((r|p)\)-centroid problem in the plane (Q456933) (← links)
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem (Q463377) (← links)
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem (Q524886) (← links)
- An exact method for the discrete \((r|p)\)-centroid problem (Q887194) (← links)
- Exact method for the capacitated competitive facility location problem (Q1652629) (← links)
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane (Q2268924) (← links)
- Local search for load balancing problems for servers with large dimension (Q2399466) (← links)
- An efficient algorithm for the Euclidean \(r\)-centrum location problem (Q2570749) (← links)
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution (Q2676299) (← links)
- VNS heuristic for the \((r|p)\)-centroid problem on the plane (Q2840744) (← links)
- A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand (Q4973258) (← links)
- Local search with an exponential neighborhood for the servers load balancing problem (Q5264767) (← links)
- An upper bound for the competitive location and capacity choice problem with multiple demand scenarios (Q5374006) (← links)
- Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players (Q6048218) (← links)
- A kernel search matheuristic to solve the discrete leader-follower location problem (Q6195396) (← links)
