Dual-RAMP for the Capacitated Single Allocation Hub Location Problem

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Communication Systems and Applications

• Publication date

  2017-07-03

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1007/978-3-319-62395-5_48
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Variable Neighborhood Search

  2018cited by this paper
• A hybridization of an evolutionary algorithm and a parallel branch and bound for solving the capacitated single allocation hub location problem

  2015cited by this paper
• Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem

  2014cited by this paper
• Hub location problems: A review of models, classification, solution techniques, and applications

  2013cited by this paper
• The capacitated single-allocation hub location problem revisited: A note on a classical formulation

  2010cited by this paper
• A simple dual-RAMP algorithm for resource constraint project scheduling

  2010cited by this paper
• RAMP for the capacitated minimum spanning tree problem

  2010cited by this paper
• Lagrangean relaxation for the capacitated hub location problem with single assignment

  2009cited by this paper
• Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation

  2008cited by this paper
• Capacitated single allocation hub location problem - A bi-criteria approach

  2008cited by this paper
• Network hub location problems: The state of the art

  2008cited by this paper
• Solving the Capacitated Single Allocation Hub Location Problem Using Genetic Algorithm

  2007cited by this paper
• A branch and cut algorithm for hub location problems with single assignment

  2005cited by this paper
• RAMP: A New Metaheuristic Framework for Combinatorial Optimization

  2005cited by this paper
• The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances

  2003cited by this paper
• New trends in exact algorithms for the 0-1 knapsack problem

  2000cited by this paper
• Solution algorithms for the capacitated single allocation hub location problem

  1999cited by this paper
• HUB NETWORK DESIGN WITH SINGLE AND MULTIPLE ALLOCATION: A COMPUTATIONAL STUDY

  1996cited by this paper
• A survey of simulated annealing applications to operations research problems

  1994cited by this paper
• OR-Library: Distributing Test Problems by Electronic Mail

  1990cited by this paper
• A quadratic integer program for the location of interacting hub facilities

  1987cited by this paper
• Adaptive Selection Methods for Genetic Algorithms

  1985cited by this paper
• Branch-and-Bound Methods: A Survey

  1966cited by this paper

• RAMP algorithms for the capacitated facility location problem

  2021cites this paper
• A dual RAMP algorithm for single source capacitated facility location problems

  2021cites this paper
• An Effective Dual-RAMP Algorithm for the Capacitated Facility Location Problem

  2021cites this paper
• A RAMP Algorithm for Large-Scale Single Source Capacitated Facility Location Problems

  2019cites this paper
• A Simple Dual-RAMP Algorithm for the Capacitated Facility Location Problem

  2019cites this paper
• Improving Traditional Dual Ascent Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem: A RAMP Approach

  2018cites this paper
• A Simple Dual-RAMP Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem

  2018cites this paper