The hub location and pricing problem
From MaRDI portal
Publication:2140288
DOI10.1016/j.ejor.2021.11.048zbMath1506.90137OpenAlexW3215258464MaRDI QIDQ2140288
Güneş Erdoğan, Maria Battarra, Antonio M. Rodríguez-Chía
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.11.048
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Uses Software
Cites Work
- Unnamed Item
- Hub location problems with price sensitive demands
- Hub location under competition
- A Stackelberg hub arc location model for a competitive environment
- An exact algorithm for the network pricing problem
- A conditional \(p\)-hub location problem with attraction functions
- New formulations and valid inequalities for a bilevel pricing problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Location of hubs in a competitive environment
- Integer programming formulations of discrete hub location problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- On the single-assignment \(p\)-hub center problem
- Exact solution of hub network design problems with profits
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- Perspectives on modeling hub location problems
- A competitive hub location and pricing problem
- A note on ``Location of hubs in a competitive environment
- Network hub location problems: The state of the art
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- A polyhedral study of the network pricing problem with connected toll arcs
- Joint Design and Pricing on a Network
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Heuristic and Special Case Algorithms for Dispersion Problems
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- STACKELBERG HUB LOCATION PROBLEM
- HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD
- Bilevel programming and price setting problems
This page was built for publication: The hub location and pricing problem
