The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers

DOI10.1134/S1990478914020045MaRDI QIDQ5264729zbMATHOpenAlexFDO

Authors Andrey Melnikov, V. L. Beresnev

Publication date 27 July 2015

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

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

zbMATH Keywords

bilevel programmingpseudo-Boolean functionbranch-and-bound methodoptimal noncooperative solution

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Noncooperative games (91A10) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• Branch-and-bound algorithm for a competitive facility location problem
• On the competitive facility location problem with a free choice of suppliers
• Approximate algorithms for the competitive facility location problem
• scientific article; zbMATH DE number 6006831
• An improved branch \& bound method for the uncapacitated competitive location problem

Cited in

(15)

• Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
• A capacitated competitive facility location problem
• Approximate algorithms for the competitive facility location problem
• Local search algorithms for the problem of competitive location of enterprises
• Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems
• Competitive facility location on decentralized supply chains
• On the competitive facility location problem with a free choice of suppliers
• The branch and cut method for the facility location problem with client's preferences
• A mathematical model of market competition
• Cut generation algorithm for the discrete competitive facility location problem
• Exact method for the capacitated competitive facility location problem
• A cut generation algorithm of finding an optimal solution in a market competition
• Branch-and-bound algorithm for a competitive facility location problem
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Competitive facility location problem. An algorithm for the problem concerning the existence of multi-type customers

This page was built for publication: The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers

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