Alternate solution approaches for competitive hub location problems
From MaRDI portal
Publication:2029306
DOI10.1016/j.ejor.2020.07.018zbMath1487.90450OpenAlexW2999369551MaRDI QIDQ2029306
Ankur Sinha, Sachin Jayaswal, Richa Tiwari
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.07.018
Lagrangian relaxationnonlinear integer programcompetitive hub and spoke networkKelley's cutting planesecond-order conic program
Related Items (4)
Competitive multiple allocation hub location problem considering primary and backup routes ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion
Uses Software
Cites Work
- Bandwidth packing problem with queueing delays: modelling and exact solution approach
- Hub location under competition
- A Stackelberg hub arc location model for a competitive environment
- Efficient solution of a class of location-allocation problems with stochastic demand and congestion
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Adapting polyhedral properties from facility to hub location problems
- Exact solution of a class of nonlinear knapsack problems
- A conditional \(p\)-hub location problem with attraction functions
- The tree of hubs location problem
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- 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
- Second-order cone programming
- On implementing a primal-dual interior-point method for conic quadratic optimization
- On the single-assignment \(p\)-hub center problem
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- On complexity of unconstrained hyperbolic 0--1 programming problems
- Global optimization of 0-1 hyperbolic programs
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
- A competitive hub location and pricing problem
- A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
- A note on ``Location of hubs in a competitive environment
- An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- Aircraft Rescheduling with Cruise Speed Control
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- The Cutting-Plane Method for Solving Convex Programs
- The Maximal Covering Location Problem with Capacities on Total Workload
- Practical Optimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Technical Note—An Algorithm for the p-Median Problem
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- STACKELBERG HUB LOCATION PROBLEM
- Validation of subgradient optimization
- Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model
- Solving the hub location problem in a star–star network
- HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD
- Benchmarking optimization software with performance profiles.
This page was built for publication: Alternate solution approaches for competitive hub location problems
