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

DOI10.1016/J.COR.2013.02.023zbMATH Open1348.90381OpenAlexW2154477224MaRDI QIDQ336436FDOQ336436

Authors: V. L. 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

Recommendations

• The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
• On the competitive facility location problem with a free choice of suppliers
• A capacitated competitive facility location problem
• Upper bounds for goal functions of discrete competitive facility location problems
• Approximate algorithms for the competitive facility location problem

zbMATH Keywords

branch-and-bound algorithmlocal searchupper boundbilevel programming problempseudo-Boolean function

Mathematics Subject Classification ID

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

Cites Work

• Foundations of bilevel programming
• An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness property
• Pseudo-Boolean Programming
• Title not available (Why is that?)
• Branch-and-Bound Methods: General Formulation and Properties
• Competitive Location on a Network
• The simple plant location problem: Survey and synthesis
• Multiple voting location problems
• An exact procedure and LP formulations for the leader-follower location problem

Cited In (27)

• Approximation of the competitive facility location problem with MIPs
• On the competitive facility location problem with a free choice of suppliers
• The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers
• A capacitated competitive facility location problem
• A cut generation algorithm of finding an optimal solution in a market competition
• A variational inequality formulation for designing a multi-echelon, multi-product supply chain network in a competitive environment
• Upper bounds for goal functions of discrete competitive facility location problems
• Exact method for the capacitated competitive facility location problem
• Title not available (Why is that?)
• A branch-and-price algorithm for the capacitated facility location problem
• Discrete competitive facility location: modeling and optimization approaches
• A mathematical model of market competition
• Locating facilities in a competitive environment
• Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems
• Computational complexity of the discrete competitive facility location problem
• A local search heuristic for the \((r| p)\)-centroid problem in the plane
• 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
• A robust and efficient algorithm for planar competitive location problems
• Competitive Facility Location with Selfish Users and Queues
• Bilevel optimization: theory, algorithms, applications and a bibliography
• An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
• Cournot-Stackelberg games in competitive delocation
• A study on the use of heuristics to solve a bilevel programming problem
• Approximate algorithms for the competitive facility location problem
• Local search algorithms for the problem of competitive location of enterprises
• \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario

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

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