Exact and heuristic approaches for the cycle hub location problem

DOI10.1007/S10479-015-2091-2MaRDI QIDQ1686520zbMATH OpenOpenAlexFDO

Authors Moayad Tanash, Navneet Vidyarthi, Ivan 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

branch-and-cutcycleshub locationGRASP

Mathematics Subject Classification ID

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

Recommendations

• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• A branch-and-cut algorithm for the plant-cycle location problem
• An efficient heuristic for a hub location routing problem
• A branch-and-cut algorithm for the hub location and routing problem
• Locating median cycles in networks

Cites work

• scientific article; zbMATH DE number 1075641 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• A branch and cut algorithm for hub location problems with single assignment
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• A hub location problem in designing digital data service networks: Lagrangian relaxation approach
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Adapting polyhedral properties from facility to hub location problems
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• An improved Benders decomposition algorithm for the tree of hubs location problem
• Benders decomposition for large-scale uncapacitated hub location
• Exact and heuristic algorithms for the design of hub networks with multiple lines
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• General network design: a unified view of combined location and network design problems
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• Hub arc location problems: I. Introduction and results
• Hub location as the minimization of a supermodular set function
• Locating median cycles in networks
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• Multi-period hub network design problems with modular capacities
• Network hub location problems: The state of the art
• Optimizing a ring-based private line telecommunication network using tabu search
• Projecting the flow variables for hub location problems
• Solving the hub location problem in a star–star network
• Star p-hub center problem and star p-hub median problem with bounded path lengths
• Star \(p\)-hub median problem with modular arc capacities
• The Capacitated m-Ring-Star Problem
• The Covering Tour Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• The median tour and maximal covering tour problems: Formulations and heuristics
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
• The planar hub location problem: a probabilistic clustering approach
• The tree of hubs location problem
• Tight bounds from a path based formulation for the tree of hub location problem

Cited in

(26)

• Lower Bounds for the Hub Location Problem
• Multiple allocation tree of hubs location problem for non-complete networks
• Solving partitioning-hub location-routing problem using DCA
• Less is more: general variable neighborhood search for the capacitated modular hub location problem
• Continuous maximal covering location problems with interconnected facilities
• Locating a cycle in a transportation or a telecommunications network
• On carriers collaboration in hub location problems
• Upgrading nodes in tree-shaped hub location
• An exact solution procedure for a cluster hub location problem
• The profit-oriented hub line location problem with elastic demand
• Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
• The hub location problem with market selection
• A branch-and-cut algorithm for the plant-cycle location problem
• Efficient heuristics for Median Cycle Problems
• Exact and heuristic algorithms for the design of hub networks with multiple lines
• The capacitated directed cycle hub location and routing problem under congestion
• A branch‐and‐cut algorithm for hub network design problems with profits
• Planning and design of intermodal hub networks: a literature review
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
• A two-phase heuristic approach to the bike repositioning problem
• Efficient approaches for the flooding problem on graphs
• Solving the continuous multiple allocation \(p\)-hub median problem by the hyperbolic smoothing approach
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
• Locating median cycles in networks
• Hub location problem in round-trip service applications
• Perspectives on modeling hub location problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686520)