Randomized local search for the discrete competitive facility location problem
From MaRDI portal
(Redirected from Publication:463379)
Recommendations
- Approximate algorithms for the competitive facility location problem
- scientific article; zbMATH DE number 6006831
- Computational complexity of the discrete competitive facility location problem
- scientific article; zbMATH DE number 5991640
- The maximum capture problem with random utilities: problem formulation and algorithms
Cites work
- scientific article; zbMATH DE number 9247 (Why is no real title available?)
- A strengthened formulation for the simple plant location problem with order
- An Efficient Heuristic Procedure for Partitioning Graphs
- Competitive Location on a Network
- Competitive facility location models
- Competitive location, production, and market selection
- Market and Locational Equilibrium for Two Competitors
- On price competition in location-price models with spatially separated makets
- The simple plant location problem: Survey and synthesis
Cited in
(18)- Approximation of the competitive facility location problem with MIPs
- VNS-based heuristic with an exponential neighborhood for the server load balancing problem
- A bilevel planning model for public-private partnership
- A capacitated competitive facility location problem
- Local search with an exponential neighborhood for the servers load balancing problem
- An approximation algorithm for a competitive facility location problem with network effects
- A cut generation algorithm of finding an optimal solution in a market competition
- Exact method for the capacitated competitive facility location problem
- Discrete competitive facility location: modeling and optimization approaches
- Locating facilities in a competitive environment
- Computational complexity of the discrete competitive facility location problem
- Improving resource location with locally precomputed partial random walks
- Local search for load balancing problems for servers with large dimension
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- Sequential location of two facilities: comparing random to optimal location of the first facility
- An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
- -Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
- Improving solution of discrete competitive facility location problems
This page was built for publication: Randomized local search for the discrete competitive facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463379)
