Branch-and-bound algorithm for a competitive facility location problem

DOI10.1016/J.COR.2013.02.023zbMath1348.90381OpenAlexW2154477224MaRDI QIDQ336436

Vladimir Beresnev

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.023

zbMATH Keywords

branch-and-bound algorithmupper boundlocal searchbilevel programming problempseudo-Boolean function

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (20)

Locating facilities in a competitive environment ⋮ A variational inequality formulation for designing a multi-echelon, multi-product supply chain network in a competitive environment ⋮ Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems ⋮ A capacitated competitive facility location problem ⋮ A local search heuristic for the \((r| p)\)-centroid problem in the plane ⋮ Exact method for the capacitated competitive facility location problem ⋮ Cut generation algorithm for the discrete competitive facility location problem ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ Cournot-Stackelberg games in competitive delocation ⋮ Unnamed Item ⋮ An upper bound for the competitive location and capacity choice problem with multiple demand scenarios ⋮ Competitive Facility Location with Selfish Users and Queues ⋮ On the competitive facility location problem with a free choice of suppliers ⋮ Approximation of the competitive facility location problem with MIPs ⋮ A study on the use of heuristics to solve a bilevel programming problem ⋮ 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 ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Computational complexity of the discrete competitive facility location problem ⋮ Discrete Competitive Facility Location: Modeling and Optimization Approaches

Cites Work

• Unnamed Item
• Unnamed Item
• An exact procedure and LP formulations for the leader-follower location problem
• Multiple voting location problems
• Foundations of bilevel programming
• The simple plant location problem: Survey and synthesis
• Competitive Location on a Network
• Pseudo-Boolean Programming
• Branch-and-Bound Methods: General Formulation and Properties

This page was built for publication: Branch-and-bound algorithm for a competitive facility location problem