Randomized local search for the discrete competitive facility location problem

DOI10.1134/S0005117914040109zbMath1297.90071OpenAlexW1995667265MaRDI QIDQ463379

Andrey Melnikov

Publication date: 16 October 2014

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117914040109

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

Locating facilities in a competitive environment, A bilevel planning model for public-private partnership, VNS-based heuristic with an exponential neighborhood for the server load balancing problem, A capacitated competitive facility location problem, Exact method for the capacitated competitive facility location problem, Local search for load balancing problems for servers with large dimension, An upper bound for the competitive location and capacity choice problem with multiple demand scenarios, Approximation of the competitive facility location problem with MIPs, 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, \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario, Local search with an exponential neighborhood for the servers load balancing problem, Discrete Competitive Facility Location: Modeling and Optimization Approaches

Cites Work

• Unnamed Item
• On price competition in location-price models with spatially separated makets
• Competitive location, production, and market selection
• The simple plant location problem: Survey and synthesis
• A strengthened formulation for the simple plant location problem with order
• Competitive facility location models
• Competitive Location on a Network
• Market and Locational Equilibrium for Two Competitors
• An Efficient Heuristic Procedure for Partitioning Graphs