Exact and heuristic approaches for the cycle hub location problem

DOI10.1007/S10479-015-2091-2zbMath1381.90025OpenAlexW2230461717MaRDI QIDQ1686520

Navneet Vidyarthi, Moayad Tanash, Iván A. Contreras

Publication date: 15 December 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-2091-2

zbMATH Keywords

cyclesGRASPbranch-and-cuthub location

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (17)

Upgrading nodes in tree-shaped hub location ⋮ Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach ⋮ Exact and heuristic algorithms for the design of hub networks with multiple lines ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ Efficient approaches for the flooding problem on graphs ⋮ Continuous maximal covering location problems with interconnected facilities ⋮ Planning and design of intermodal hub networks: a literature review ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ The profit-oriented hub line location problem with elastic demand ⋮ A branch‐and‐cut algorithm for hub network design problems with profits ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ Less is more: general variable neighborhood search for the capacitated modular hub location problem ⋮ The hub location problem with market selection ⋮ Perspectives on modeling hub location problems ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ On carriers collaboration in hub location problems ⋮ The minimum flow cost Hamiltonian cycle problem: a comparison of formulations

Cites Work

• Unnamed Item
• Unnamed Item
• Exact and heuristic algorithms for the design of hub networks with multiple lines
• Multi-period hub network design problems with modular capacities
• Adapting polyhedral properties from facility to hub location problems
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Tight bounds from a path based formulation for the tree of hub location problem
• The tree of hubs location problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
• A branch and cut algorithm for hub location problems with single assignment
• Locating median cycles in networks
• General network design: a unified view of combined location and network design problems
• An improved Benders decomposition algorithm for the tree of hubs location problem
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
• The planar hub location problem: a probabilistic clustering approach
• Star \(p\)-hub median problem with modular arc capacities
• Network hub location problems: The state of the art
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• Benders Decomposition for Large-Scale Uncapacitated Hub Location
• Hub Location as the Minimization of a Supermodular Set Function
• Hub Arc Location Problems: Part I—Introduction and Results
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
• Projecting the flow variables for hub location problems
• The Capacitated m-Ring-Star Problem
• A hub location problem in designing digital data service networks: Lagrangian relaxation approach
• The Covering Tour Problem
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Solving the hub location problem in a star–star network

This page was built for publication: Exact and heuristic approaches for the cycle hub location problem