Exact and heuristic approaches for the cycle hub location problem
type: Item
instance of: scholarly article
title: Exact and heuristic approaches for the cycle hub location problem
zbMATH Open document ID: 1381.90025
author: Moayad Tanash
author: Navneet Vidyarthi
author: Ivan Contreras
published in: Annals of Operations Research
publication date: 2017-12-15T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6819039
zbMATH Keywords: hub location
zbMATH Keywords: cycles
zbMATH Keywords: branch-and-cut
zbMATH Keywords: GRASP
MaRDI profile type: Publication
full work available at URL: s10479-015-2091-2
OpenAlex ID: W2230461717
cites work: Network hub location problems: The state of the art
cites work: Multi-period hub network design problems with modular capacities
cites work: The Capacitated m-Ring-Star Problem
cites work: Q4359509
cites work: A tabu-search based heuristic for the hub covering problem over incomplete hub networks
cites work: Hub Arc Location Problems: Part I—Introduction and Results
cites work: Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
cites work: General network design: a unified view of combined location and network design problems
cites work: Hub Location as the Minimization of a Supermodular Set Function
cites work: Tight bounds from a path based formulation for the tree of hub location problem
cites work: The tree of hubs location problem
cites work: Benders decomposition for large-scale uncapacitated hub location
cites work: Q4371290
cites work: The median tour and maximal covering tour problems: Formulations and heuristics
cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
cites work: An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
cites work: The Covering Tour Problem
cites work: Adapting polyhedral properties from facility to hub location problems
cites work: The planar hub location problem: a probabilistic clustering approach
cites work: Projecting the flow variables for hub location problems
cites work: Solving the hub location problem in a star–star network
cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm
cites work: Locating median cycles in networks
cites work: A branch and cut algorithm for hub location problems with single assignment
cites work: A hub location problem in designing digital data service networks: Lagrangian relaxation approach
cites work: Metaheuristics and cooperative approaches for the bi-objective ring star problem
cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
cites work: The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
cites work: An improved Benders decomposition algorithm for the tree of hubs location problem
cites work: Exact and heuristic algorithms for the design of hub networks with multiple lines
cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
cites work: Star \(p\)-hub median problem with modular arc capacities
cites work: Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
DOI: 10.1007/S10479-015-2091-2
description: scientific article; zbMATH DE number 6819039