Randomized local search for the discrete competitive facility location problem

DOI10.1134/S0005117914040109zbMATH Open1297.90071OpenAlexW1995667265MaRDI QIDQ463379FDOQ463379

Authors: A. A. 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

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

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

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

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
• An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
• Sequential location of two facilities: comparing random to optimal location of the first facility
• \(\varepsilon\)-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)