A capacitated competitive facility location problem

DOI10.1134/S1990478916010075MaRDI QIDQ3186853zbMATH OpenFDO

Authors Andrey Melnikov, V. L. Beresnev

Publication date 12 August 2016

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

bilevel programmingcompetitive facility locationupper bound

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10)

Recommendations

• Exact method for the capacitated competitive facility location problem
• On the competitive facility location problem with a free choice of suppliers
• Branch-and-bound algorithm for a competitive facility location problem
• An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
• Upper bounds for goal functions of discrete competitive facility location problems

Cites work

• An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
• Approximate algorithms for the competitive facility location problem
• Branch-and-bound algorithm for a competitive facility location problem
• Competitive facility location models
• Foundations of bilevel programming
• Local search algorithms for the problem of competitive location of enterprises
• Local search over a generalized neighborhood for an optimization problem of pseudo-Boolean functions
• On the competitive facility location problem with a free choice of suppliers
• Pseudo-Boolean Programming
• Randomized local search for the discrete competitive facility location problem
• The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
• The pricing problem. I: Exact and approximate algorithms
• The pricing problem. Part II: Computational complexity
• The simple plant location problem: Survey and synthesis

Cited in

(23)

• A model for the capacitated p-facility location problem in global environments
• The capacitated plant location problem
• Exact method for the capacitated competitive facility location problem
• Customer allocation in maximum capture problems
• scientific article; zbMATH DE number 5991640 (Why is no real title available?)
• scientific article; zbMATH DE number 6006831 (Why is no real title available?)
• Facility location in unfair competition
• A capacitated facility location and inventory management problem with single sourcing
• The Maximum Capture Problem Including Relocation
• Branch-and-bound algorithm for a competitive facility location problem
• scientific article; zbMATH DE number 4097100 (Why is no real title available?)
• The congested facility location problem
• scientific article; zbMATH DE number 1323030 (Why is no real title available?)
• scientific article; zbMATH DE number 1941914 (Why is no real title available?)
• Competitive multilevel capacity allocation
• Upper bound for the capacitated competitive facility location problem
• On the competitive facility location problem with a free choice of suppliers
• Competitive Facility Location with Selfish Users and Queues
• An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
• Static competitive facility location: an overview of optimisation approaches.
• Determining the location and capacity of competitive facilities
• The facility selection-location problem
• Competitive facility location model with concave demand

This page was built for publication: A capacitated competitive facility location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186853)