Pages that link to "Item:Q2253409"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem (Q2253409):
Displaying 26 items.
- Models and algorithms for competitive facility location problems with different customer behavior (Q276530) (← links)
- A local search heuristic for the \((r| p)\)-centroid problem in the plane (Q337239) (← links)
- \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
- 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)
- On competition in a Stackelberg location-design model with deterministic supplier choice (Q512976) (← 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)
- \((r,p)\)-centroid problems on paths and trees (Q1034634) (← links)
- Exact method for the capacitated competitive facility location problem (Q1652629) (← links)
- Integer programming formulations for three sequential discrete competitive location problems with foresight (Q1681140) (← links)
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches (Q1683064) (← links)
- An exact approach for the \(r\)-interdiction covering problem with fortification (Q1725826) (← links)
- Radio communications interdiction problem under deterministic and probabilistic jamming (Q1738838) (← links)
- Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem (Q2289952) (← links)
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952) (← 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)
- Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems (Q3458816) (← links)
- Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction (Q5090156) (← links)
- An exact approach for the r-interdiction median problem with fortification (Q5242354) (← links)
- Discrete Competitive Facility Location: Modeling and Optimization Approaches (Q5270511) (← links)
- Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players (Q6048218) (← links)
- Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem (Q6065606) (← links)
- The generalized discrete ‐centroid problem (Q6066305) (← links)
- A kernel search matheuristic to solve the discrete leader-follower location problem (Q6195396) (← links)
