Exact and heuristic approaches for the cycle hub location problem
From MaRDI portal
Publication:1686520
DOI10.1007/S10479-015-2091-2zbMATH Open1381.90025OpenAlexW2230461717MaRDI QIDQ1686520FDOQ1686520
Ivan Contreras, Navneet Vidyarthi, Moayad Tanash
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
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
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)
Cites Work
- The tree of hubs location problem
- 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
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Network hub location problems: The state of the art
- Benders decomposition for large-scale uncapacitated hub location
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Adapting polyhedral properties from facility to hub location problems
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- The Capacitated m-Ring-Star Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- The median tour and maximal covering tour problems: Formulations and heuristics
- A branch and cut algorithm for hub location problems with single assignment
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Projecting the flow variables for hub location problems
- Tight bounds from a path based formulation for the tree of hub location problem
- The Covering Tour Problem
- Title not available (Why is that?)
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Hub Location as the Minimization of a Supermodular Set Function
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- Solving the hub location problem in a star–star network
- Metaheuristics and cooperative approaches for the bi-objective ring star problem
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- Locating median cycles in networks
- Star \(p\)-hub median problem with modular arc capacities
- Title not available (Why is that?)
- Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
- Multi-period hub network design problems with modular capacities
- The planar hub location problem: a probabilistic clustering approach
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
- A hub location problem in designing digital data service networks: Lagrangian relaxation approach
Cited In (23)
- Multiple allocation tree of hubs location problem for non-complete networks
- Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach
- 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
- The profit-oriented hub line location problem with elastic demand
- A branch-and-cut algorithm for the plant-cycle location problem
- Efficient heuristics for Median Cycle Problems
- The hub location problem with market selection
- 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
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
- 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
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
- Locating median cycles in networks
- Perspectives on modeling hub location problems
- Lower Bounds for the Hub Location Problem
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)
