A Leader-Follower Hub Location Problem Under Fixed Markups

DOI10.1007/978-3-319-44914-2_28zbMath1385.90013OpenAlexW2557622738MaRDI QIDQ3133227

Dimitrije D. Čvokić, Yury A. Kochetov, Aleksandr V. Plyasunov

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_28

zbMATH Keywords

pricingStackelberg competitionmatheuristichub locationlinear reformulationfixed markup

Mathematics Subject Classification ID

Mixed integer programming (90C11) Cooperative games (91A12) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (6)

A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war ⋮ A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand ⋮ A kernel search matheuristic to solve the discrete leader-follower location problem ⋮ Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ A leader-follower single allocation hub location problem under fixed markups

This page was built for publication: A Leader-Follower Hub Location Problem Under Fixed Markups