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

DOI10.1134/S0005117914040079zbMATH Open1297.90068MaRDI QIDQ463373FDOQ463373

V. L. Beresnev

Publication date: 16 October 2014

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

Recommendations

• Branch-and-bound algorithm for a competitive facility location problem
• A capacitated competitive facility location problem
• Upper bounds for goal functions of discrete competitive facility location problems
• The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
• Competitive facility location models

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• Sequential discrete \(p\)-facility models for competitive location planning
• Approximation of the competitive facility location problem with MIPs
• Title not available (Why is that?)
• A bilevel planning model for public-private partnership
• Discrete Competitive Facility Location: Modeling and Optimization Approaches
• A capacitated competitive facility location problem
• An approximation algorithm for a competitive facility location problem with network effects
• Exact method for the capacitated competitive facility location problem
• Title not available (Why is that?)
• Additional constraints for dynamic competitive facility location problem
• An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
• Competitive facility location models
• 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

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

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