Benders decomposition algorithms for two variants of the single allocation hub location problem
type: Item
instance of: scholarly article
title: Benders decomposition algorithms for two variants of the single allocation hub location problem
published in: Networks and Spatial Economics
publication date: 2020-10-08T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/52990
Mathematics Subject Classification ID: 90-XX
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7257995
zbMATH Keywords: hub location problem
zbMATH Keywords: single allocation
zbMATH Keywords: benders decomposition
zbMATH Keywords: branch-and-cut
zbMATH Keywords: algorithmic refinements
author: Nader Ghaffari-Nasab
author: Bahar Y. Kara
MaRDI profile type: Publication
OpenAlex ID: W2896366659
cites work: A hybrid heuristic for the uncapacitated hub location problem
cites work: Solution approaches to hub location problems
cites work: Network hub location problems: The state of the art
cites work: Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Integer programming formulations of discrete hub location problems
cites work: Lagrangean relaxation for the capacitated hub location problem with single assignment
cites work: Benders decomposition for large-scale uncapacitated hub location
cites work: Stochastic uncapacitated hub location
cites work: Branch and price for large-scale capacitated hub location problems with single assignment
cites work: A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
cites work: Benders decomposition for the uncapacitated multiple allocation hub location problem
cites work: Multiple allocation hub-and-spoke network design under hub congestion
cites work: A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
cites work: A new formulation and an exact approach for the many-to-many hub location-routing problem
cites work: An improved Benders decomposition algorithm for the tree of hubs location problem
cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem
cites work: An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
cites work: Solution algorithms for the capacitated single allocation hub location problem
cites work: A Benders Decomposition for Hub Location Problems Arising in Public Transport
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
cites work: Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: A compact linearisation of Euclidean single allocation hub location problems
cites work: A quadratic integer program for the location of interacting hub facilities
cites work: Hub location problems with price sensitive demands
cites work: Spatial analysis of single allocation hub location problems
cites work: The Benders decomposition algorithm: a literature review
cites work: A Cross Decomposition Algorithm for Capacitated Facility Location
cites work: New simple and efficient heuristics for the uncapacitated single allocation hub location problem
cites work: On tabu search for the location of interacting hub facilities
cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
cites work: A hub covering model for cargo delivery systems
cites work: Endogenous effects of hubbing on flow intensities
cites work: An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
cites work: Solving the uncapacitated hub location problem using genetic algorithms
cites work: A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
cites work: Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model
cites work: Q4716341
DOI: 10.1007/S11067-018-9424-Z
description: scientific article; zbMATH DE number 7257995