ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS

No abstract is available for this paper.

• Publication year

  2003

• Venue

  Journal of The Operations Research Society of Japan

• Publication date

  2003-12-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.15807/JORSJ.46.409
• 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 Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

  2000cited by this paper
• The capacitated multiple allocation hub location problem: Formulations and algorithms

  2000cited by this paper
• On the selection of hub airports for an airline hub-and-spoke system

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

  1999cited by this paper
• Optimization Toolbox User's Guide

  1998cited by this paper
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems

  1998cited by this paper
• Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem

  1998cited by this paper
• Hub location with flow economies of scale

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

  1996cited by this paper
• Efficient algorithms for the uncapac-itated single allocation p-hub median problem

  1996cited by this paper
• A Dual Ascent Approach to the Fixed-Charge Capacitated Network Design Problem

  1996cited by this paper
• Hub Location and the p-Hub Median Problem

  1996cited by this paper
• Tight linear programming relaxations of uncapacitated p-hub median problems

  1996cited by this paper
• AIRLINE NETWORK DESIGN AND HUB LOCATION PROBLEMS

  1996cited by this paper
• Lower bounds for the hub location problem

  1995cited by this paper
• Integer programming formulations of discrete hub location problems

  1994cited by this paper
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem

  1994influential reference
• A quadratic integer program for the location of interacting hub facilities

  1987influential reference
• Mathematical Programming: Theory and Algorithms

  1986cited by this paper
• An Algorithmic Approach to Network Location Problems. II: The p-Medians

  1979cited by this paper
• Minimization of unsmooth functionals

  1969cited by this paper

• Designing an economies-of-scale hub-and-spoke network with congestion and interruption risks in hubs

  2025cites this paper
• The capacitated r-hub interdiction problem with congestion: Models and solution approaches

  2024cites this paper
• Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm

  2021cites this paper
• Robust optimisation of the intermodal freight transport problem: Modeling and solving with an efficient hybrid approach

  2019cites this paper
• Capacited P-hub location problem allowing direct flow between spokes in intermodal transportation network

  2019cites this paper
• Hub Network Design and Discrete Location: Economies of Scale, Reliability and Service Level Considerations

  2018influential citation
• Alternate second order conic programming reformulations for hub location with capacity selection under demand uncertainty

  2018influential citation
• Design of transportation and distribution Oil Palm Trunk of (OPT) in Indonesia

  2018cites this paper
• Managing congestion in supply chains via dynamic freight routing: An application in the biomass supply chain

  2017cites this paper
• An exact algorithm for the modular hub location problem with single assignments

  2017cites this paper
• A capacitated hub location problem under hose demand uncertainty

  2017cites this paper
• Heuristics for the capacitated modular hub location problem

  2017cites this paper
• An interactive possibilistic programming approach for a multi-objective hub location problem: Economic and environmental design

  2017cites this paper
• Robust optimization approach to capacitated single and multiple allocation hub location problems

  2016cites this paper
• Multi-objective hub network design under uncertainty considering congestion: An M/M/c/K queue system

  2016cites this paper
• Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search

  2016cites this paper
• Incremental Optimization of Hub and Spoke Network for the Spokes’ Numbers and Flow

  2015cites this paper
• Lagrangian Relaxation for q-Hub Arc Location Problems

  2014cites this paper
• Capacitated Centralized Carrier Collaboration Multihub Location Problem

  2014cites this paper
• Research on Airline Network Design under Hub Airport Capacity Uncertainty

  2014cites this paper
• Modeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch

  2013cites this paper
• A multi-objective hub covering location problem under congestion using simulated annealing algorithm

  2013cites this paper
• Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels

  2012cites this paper
• Hub location under uncertainty

  2012cites this paper
• Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment

  2011cites this paper
• An evolutionary-based approach for solving a capacitated hub location problem

  2011cites this paper
• Liner Shipping Hub Network Design in a Competitive Environment

  2010cites this paper
• Metaheuristic search procedure based on fuzzy graph for p-facility problems

  2010cites this paper
• A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion

  2010cites this paper
• Designing Hub Networks with Connected and Isolated Hubs

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

  2009cites this paper
• Network hub location problems: The state of the art

  2008cites this paper