Hub location problems with price sensitive demands
From MaRDI portal
Publication:264310
DOI10.1007/s11067-014-9276-0zbMath1332.90139OpenAlexW2065193096MaRDI QIDQ264310
Morton E. O'Kelly, Gilberto~jun. de Miranda, Ricardo S. de Camargo, Henrique Pacca Loureiro Luna
Publication date: 31 March 2016
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-014-9276-0
Benders decomposition algorithmsquality of service (QoS) price equilibrium problemsuncapacitated multiple allocation hub location
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Microeconomic theory (price theory and economic markets) (91B24) Discrete location and assignment (90B80) Consumer behavior, demand theory (91B42)
Related Items (12)
Spatial analysis of single allocation hub location problems ⋮ The hub location and pricing problem ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ 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 ⋮ Planning and design of intermodal hub networks: a literature review ⋮ Integrated multi-level intermodal network design problem: a sustainable approach, based on competition of rail and road transportation systems ⋮ The Benders decomposition algorithm: a literature review ⋮ Exact solution of hub network design problems with profits ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ Perspectives on modeling hub location problems ⋮ A single allocation hub location and pricing problem
Cites Work
- Unnamed Item
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- Stochastic uncapacitated hub location
- Generalized Benders' decomposition for topology optimization problems
- Multi-period near-equilibrium in a pool-based electricity market including on/off decisions
- Multiple allocation hub-and-spoke network design under hub congestion
- An integrated model for logistics network design
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Routing traffic at hub facilities
- Practical enhancements to the Magnanti-Wong method
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- Partitioning procedures for solving mixed-variables programming problems
- General economic equilibrium and variational inequalities
- The many-to-many location-routing problem
- Integer programming formulations of discrete hub location problems
- A supply chain network equilibrium model with random demands.
- Restructuring of Swiss parcel delivery services
- Planning models for long-haul operations of postal and express shipment companies
- A comparison of optimal methods for local access uncapacitated network design
- A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
- Multicommodity network expansion under elastic demands
- An improved Benders decomposition algorithm for the tree of hubs location problem
- A tighter formulation of the \(p\)-median problem
- A competitive hub location and pricing problem
- Generalized Benders decomposition
- A note on the selection of Benders' cuts
- Airline Network Design
- A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
- Multicommodity Distribution System Design by Benders Decomposition
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Report: Some recent developments in network economics
- Hub Location Problems: The Location of Interacting Facilities
- Traffic assignment problem for a general network
- Capacity and flow assignment of data networks by generalized Benders decomposition
- Network economics. A variational inequality approach.
This page was built for publication: Hub location problems with price sensitive demands
