Cut generation algorithm for the discrete competitive facility location problem

DOI10.1134/S1064562418030183zbMath1401.90109OpenAlexW2884999470WikidataQ129560751 ScholiaQ129560751MaRDI QIDQ1673703

Vladimir Beresnev, Andrey Melnikov

Publication date: 13 September 2018

Published in: Doklady Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80)

Related Items (2)

Upper bound for the competitive facility location problem with demand uncertainty ⋮ A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition

Cites Work

• Branch-and-bound algorithm for a competitive facility location problem
• Foundations of bilevel programming
• A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
• A strengthened formulation for the simple plant location problem with order

This page was built for publication: Cut generation algorithm for the discrete competitive facility location problem