Pages that link to "Item:Q887194"
From MaRDI portal
The following pages link to An exact method for the discrete \((r|p)\)-centroid problem (Q887194):
Displaying 16 items.
- 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)
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches (Q1683064) (← links)
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem (Q2253409) (← links)
- Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem (Q2289952) (← links)
- Locating facilities in a competitive environment (Q2359402) (← 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)
- No dice: a deterministic approach to the Cartan centroid (Q2839722) (← links)
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
- A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand (Q4973258) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← 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)
- A kernel search matheuristic to solve the discrete leader-follower location problem (Q6195396) (← links)
