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

DOI10.1134/S1990478914020045zbMath1324.90105OpenAlexW2001063746MaRDI QIDQ5264729

Andrey Melnikov, Vladimir 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 programmingbranch-and-bound methodpseudo-Boolean functionoptimal noncooperative solution

Mathematics Subject Classification ID

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

Related Items (4)

A capacitated 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 ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

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