On the competitive facility location problem with a free choice of suppliers

DOI10.1134/S0005117914040079zbMath1297.90068MaRDI QIDQ463373

Vladimir Beresnev

Publication date: 16 October 2014

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

Mathematics Subject Classification ID

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

Related Items (10)

A bilevel planning model for public-private partnership ⋮ A capacitated competitive facility location problem ⋮ Exact method for the capacitated competitive facility location problem ⋮ Unnamed Item ⋮ 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 ⋮ Discrete Competitive Facility Location: Modeling and Optimization Approaches

Cites Work

• Branch-and-bound algorithm for a competitive facility location problem
• Foundations of bilevel programming
• The simple plant location problem: Survey and synthesis
• Local search algorithms for the problem of competitive location of enterprises
• Competitive facility location models
• The pricing problem. Part I: Exact and approximate algorithms
• The pricing problem. Part II: Computational complexity
• Pseudo-Boolean Programming

This page was built for publication: On the competitive facility location problem with a free choice of suppliers