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

DOI10.1134/S1990478914020045zbMATH Open1324.90105OpenAlexW2001063746MaRDI QIDQ5264729FDOQ5264729

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)

Cited In (6)

• A capacitated competitive facility location problem
• Exact method for the capacitated competitive facility location problem
• Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
• Competitive facility location problem. An algorithm for the problem concerning the existence of multi-type customers
• A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition

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)