Approximation algorithms for single allocation k-hub center problem

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A general variable neighborhood search for solving the uncapacitated $$r$$r-allocation $$p$$p-hub median problem

  2017cited by this paper
• Solving uncapacitated multiple allocation p-hub center problem by Dijkstra’s algorithm-based genetic algorithm and simulated annealing

  2015cited by this paper
• General variable neighborhood search for the uncapacitated single allocation p-hub center problem

  2015cited by this paper
• Optimizing fuzzy p-hub center problem with generalized value-at-risk criterion

  2014cited by this paper
• An improved hybrid particle swarm optimization algorithm for fuzzy p-hub center problem

  2013cited by this paper
• Solving fuzzy p-hub center problem by genetic algorithm incorporating local search

  2013cited by this paper
• A 2-phase algorithm for solving the single allocation p-hub center problem

  2009cited by this paper
• Uncapacitated single and multiple allocation p-hub center problems

  2009cited by this paper
• A solution to the hub center problem via a single-relocation algorithm with tabu search

  2001cited by this paper
• On the single-assignment p-hub center problem

  2000cited by this paper
• Solution strategies for the single facility minimax hub location problem

  1991cited by this paper

• On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality

  2022cites this paper
• Improved Hardness and Approximation Results for Single Allocation Hub Location

  2020cites this paper
• Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs

  2018cites this paper
• Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality

  2018cites this paper
• , 1994-B 434 a BenApproximation algorithms for hub location problems /

  2018cites this paper
• Tight Approximability of the Server Allocation Problem for Real-Time Applications

  2017cites this paper
• On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality

  2017cites this paper
• The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality

  2017cites this paper