Alternate solution approaches for competitive hub location problems
type: Item
instance of: scholarly article
title: Alternate solution approaches for competitive hub location problems
zbMATH Open document ID: 1487.90450
author: Richa Tiwari
author: Sachin Jayaswal
author: Ankur Sinha
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7354579
zbMATH Keywords: competitive hub and spoke network
zbMATH Keywords: nonlinear integer program
zbMATH Keywords: Kelley's cutting plane
zbMATH Keywords: second-order conic program
zbMATH Keywords: Lagrangian relaxation
describes a project that uses: CPLEX
describes a project that uses: Gurobi
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.07.018
OpenAlex ID: W2999369551
cites work: Aircraft Rescheduling with Cruise Speed Control
cites work: Second-order cone programming
cites work: On implementing a primal-dual interior-point method for conic quadratic optimization
cites work: Practical Optimization
cites work: Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
cites work: A Column Generation Algorithm for Choice-Based Network Revenue Management
cites work: Location and allocation for distribution systems with transshipments and transportion economies of scale
cites work: Integer programming formulations of discrete hub location problems
cites work: Hub Location and the p-Hub Median Problem
cites work: The tree of hubs location problem
cites work: Benchmarking optimization software with performance profiles.
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: A conditional \(p\)-hub location problem with attraction functions
cites work: Exact solution of a class of nonlinear knapsack problems
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Adapting polyhedral properties from facility to hub location problems
cites work: Validation of subgradient optimization
cites work: A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
cites work: On the single-assignment \(p\)-hub center problem
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Solving the hub location problem in a star–star network
cites work: A competitive hub location and pricing problem
cites work: Hub location under competition
cites work: Location of hubs in a competitive environment
cites work: 'Multidimensional' extensions and a nested dual approach for the m-median problem
cites work: Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
cites work: Technical Note—An Algorithm for the p-Median Problem
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: The Maximal Covering Location Problem with Capacities on Total Workload
cites work: An efficient procedure for designing single allocation hub and spoke systems
cites work: On complexity of unconstrained hyperbolic 0--1 programming problems
cites work: HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD
cites work: A Stackelberg hub arc location model for a competitive environment
cites work: STACKELBERG HUB LOCATION PROBLEM
cites work: Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
cites work: Global optimization of 0-1 hyperbolic programs
cites work: A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
cites work: Efficient solution of a class of location-allocation problems with stochastic demand and congestion
cites work: Bandwidth packing problem with queueing delays: modelling and exact solution approach
cites work: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
cites work: A note on ``Location of hubs in a competitive environment''
DOI: 10.1016/J.EJOR.2020.07.018
description: scientific article; zbMATH DE number 7354579