On the public citation graph
Hub facility location with fixed costs
0 signed · 140 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1985.tb00360.xopenalex-snapshot
Models for Configuring Large-Scale Distributed Computing Systems
inferredcites →https://doi.org/10.1002/net.3230120402openalex-snapshot
Topological design of centralized computer networks—formulations and algorithms
inferredcites →https://doi.org/10.1002/net.3230130211openalex-snapshot
Centralized teleprocessing network design
inferredcites →https://doi.org/10.1002/net.3230190404openalex-snapshot
Designing satellite communication networks by zero—one quadratic programming
inferredcites →https://doi.org/10.1007/bf00929288openalex-snapshot
Optimal and suboptimal capacity allocation in communication networks
inferredcites →https://doi.org/10.1007/bf02060483openalex-snapshot
Avoiding local optima in thep-hub location problem using tabu search and GRASP
inferredcites →https://doi.org/10.1016/0191-2607(89)90074-5openalex-snapshot
Configuration of an overnight package air network
inferredcites →https://doi.org/10.1016/0191-2615(80)90037-5openalex-snapshot
A model for the blocking of trains
inferredcites →https://doi.org/10.1016/0191-2615(89)90002-7openalex-snapshot
Route choice on freight networks with concave costs and exclusive arcs
inferredcites →https://doi.org/10.1016/0305-0548(87)90022-0openalex-snapshot
Efficient algorithms for the capacitated concentrator location problem
inferredcites →https://doi.org/10.1016/0377-2217(91)90090-iopenalex-snapshot
Heuristics for the p-hub location problem
inferredcites →https://doi.org/10.1016/0377-2217(94)90318-2openalex-snapshot
Integer programming formulations of discrete hub location problems
inferredcites →https://doi.org/10.1016/s0377-2217(87)80007-3openalex-snapshot
A quadratic integer program for the location of interacting hub facilities
inferredcites →https://doi.org/10.1080/03081069008717429openalex-snapshot
The hierarchical‐hub model for airline networks
inferredcites →https://doi.org/10.1111/j.1538-4632.1970.tb00142.xopenalex-snapshot
Central Facilities Location
inferredcites →https://doi.org/10.1111/j.1538-4632.1970.tb00864.xopenalex-snapshot
Central Facilities Location under an Investment Constraint
inferredcites →https://doi.org/10.1111/j.1538-4632.1986.tb00106.xopenalex-snapshot
Activity Levels at Hub Facilities in Interacting Networks
inferredcites →https://doi.org/10.1137/0120011openalex-snapshot
An Optimization Problem in Communication Nets
inferredcites →https://doi.org/10.1287/mnsc.26.11.1096openalex-snapshot
A Mixed-Integer Programming Approach to Air Cargo Fleet Planning
inferredcites →https://doi.org/10.1287/opre.12.3.450openalex-snapshot
Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
inferredcites →https://doi.org/10.1287/opre.13.3.462openalex-snapshot
Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
inferredcites →https://doi.org/10.1287/opre.26.6.992openalex-snapshot
A Dual-Based Procedure for Uncapacitated Facility Location
inferredcites →https://doi.org/10.1287/trsc.20.2.92openalex-snapshot
The Location of Interacting Hub Facilities
inferredcites →https://doi.org/10.1287/trsc.22.2.139openalex-snapshot
A Multiobjective Hierarchical Covering Model for the Essential Air Services Program
inferredcites →https://doi.org/10.1287/trsc.23.2.91openalex-snapshot
A Lagrangian Relaxation Approach to Assigning Aircraft to Routes in Hub and Spoke Networks
inferredcites →https://doi.org/10.2307/2525301openalex-snapshot
Allocating Indivisible Resources Affording External Economies or Diseconomies
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.1490940openalex-extracted
Enriching the Tactical Network Design of Express Service Carriers with Fleet Scheduling Characteristics
inferred← citeshttps://doi.org/10.1002/9781118600283.ch5openalex-snapshot
Operations Research and Goods Transportation
inferred← citeshttps://doi.org/10.1002/9781119005384.ch5openalex-snapshot
Operations Research and Goods Transportation
inferred← citeshttps://doi.org/10.1007/978-0-387-88617-6_7openalex-snapshot
On the Quadratic Programming Approach for Hub Location Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7572-0_12openalex-snapshot
Hub Location Problems: The Location of Interacting Facilities
inferred← citeshttps://doi.org/10.1007/978-3-319-12856-6_4openalex-snapshot
Strategic Planning of Optimal Networks for Parcel and Letter Mail
inferred← citeshttps://doi.org/10.1007/978-3-319-24264-4_30openalex-snapshot
Consolidation of Residual Volumes in a Parcel Service Provider’s Long-Haul Transportation Network
inferred← citeshttps://doi.org/10.1007/978-3-319-44914-2_28openalex-snapshot
A Leader-Follower Hub Location Problem Under Fixed Markups
inferred← citeshttps://doi.org/10.1007/978-3-540-72929-7_3openalex-snapshot
Planung logistischer Systeme
inferred← citeshttps://doi.org/10.1007/978-3-662-57782-0_1openalex-snapshot
Betriebliche Standortplanung
inferred← citeshttps://doi.org/10.1007/s00500-012-0919-0openalex-snapshot
An efficient memetic algorithm for the uncapacitated single allocation hub location problem
inferred← citeshttps://doi.org/10.1007/s10479-022-04553-2openalex-snapshot
Multiple allocation hub covering flow problem under uncertainty
inferred← citeshttps://doi.org/10.1007/s10696-010-9066-zopenalex-snapshot
Enriching the tactical network design of express service carriers with fleet scheduling characteristics
inferred← citeshttps://doi.org/10.1007/s11067-014-9276-0openalex-snapshot
Hub Location Problems with Price Sensitive Demands
inferred← citeshttps://doi.org/10.1007/s11067-015-9311-9openalex-snapshot
Spatial Analysis of Single Allocation Hub Location Problems
inferred← citeshttps://doi.org/10.1007/s11067-018-9424-zopenalex-snapshot
Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem
inferred← citeshttps://doi.org/10.1007/s11859-010-0694-7openalex-snapshot
Logistics network design for manufacturing enterprises with component processing workshops
inferred← citeshttps://doi.org/10.1007/s12046-019-1188-8openalex-snapshot
Capacited P-hub location problem allowing direct flow between spokes in intermodal transportation network
inferred← citeshttps://doi.org/10.1007/s12351-023-00765-xopenalex-snapshot
A robust optimization model for dynamic virtual hub location problem under uncertainty using an M/M/C/K queuing model: two metaheuristic algorithms
inferred← citeshttps://doi.org/10.1007/s12351-026-01027-2openalex-snapshot
A GVNS algorithm applied to the uncapacitated single allocation hub maximal covering problem with fixed costs
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90318-2openalex-snapshot
Integer programming formulations of discrete hub location problems
inferred← citeshttps://doi.org/10.1016/0966-6923(94)90032-9openalex-snapshot
The hub network design problem
inferred← citeshttps://doi.org/10.1016/j.apm.2009.03.018openalex-snapshot
Stochastic air freight hub location and flight routes planning
inferred← citeshttps://doi.org/10.1016/j.apm.2013.02.035openalex-snapshot
A new formulation and an exact approach for the many-to-many hub location-routing problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.08.035openalex-snapshot
A multi-start iterated local search algorithm for the uncapacitated single allocation hub location problem
inferred← citeshttps://doi.org/10.1016/j.cie.2015.12.028openalex-snapshot
An efficient tabu search for solving the uncapacitated single allocation hub location problem
inferred← citeshttps://doi.org/10.1016/j.cie.2018.09.010openalex-snapshot
Airline hub-and-spoke network design based on airport capacity envelope curve: A practical view
inferred← citeshttps://doi.org/10.1016/j.cie.2019.01.049openalex-snapshot
Production planning in industrial townships modeled as hub location–allocation problems considering congestion in manufacturing plants
inferred← citeshttps://doi.org/10.1016/j.cor.2003.09.008openalex-snapshot
Solving the uncapacitated hub location problem using genetic algorithms
inferred← citeshttps://doi.org/10.1016/j.cor.2008.11.023openalex-snapshot
A tabu-search based heuristic for the hub covering problem over incomplete hub networks
inferred← citeshttps://doi.org/10.1016/j.cor.2008.12.019openalex-snapshot
New simple and efficient heuristics for the uncapacitated single allocation hub location problem
inferred← citeshttps://doi.org/10.1016/j.cor.2017.08.001openalex-snapshot
Benders decomposition applied to a robust multiple allocation incomplete hub location problem
inferred← citeshttps://doi.org/10.1016/j.cstp.2016.12.003openalex-snapshot
Development of hub and spoke model for improving operational efficiency of bus transit network of Bangalore city
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.03.057openalex-snapshot
A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.08.028openalex-snapshot
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.02.011openalex-snapshot
An exact solution procedure for a cluster hub location problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.06.008openalex-snapshot
Network hub location problems: The state of the art
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.01.014openalex-snapshot
Allocation strategies in hub networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.11.009openalex-snapshot
General network design: A unified view of combined location and network design problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.09.008openalex-snapshot
Hub location under competition
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.09.039openalex-snapshot
Perspectives on modeling hub location problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.11.020openalex-snapshot
A review of transport market modeling using game-theoretic principles
inferred← citeshttps://doi.org/10.1016/j.energy.2019.04.186openalex-snapshot
Quantum computing for energy systems optimization: Challenges and opportunities
inferred← citeshttps://doi.org/10.1016/j.eswa.2017.10.005openalex-snapshot
Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements
inferred← citeshttps://doi.org/10.1016/j.jtrangeo.2013.01.009openalex-snapshot
Modeling the airline hub location and optimal market problems with continuous approximation techniques
inferred← citeshttps://doi.org/10.1016/j.ocecoaman.2022.106230openalex-snapshot
Hub-and-spoke network design for container shipping considering disruption and congestion in the post COVID-19 era
inferred← citeshttps://doi.org/10.1016/j.omega.2018.05.016openalex-snapshot
Profit maximizing hub location problems
inferred← citeshttps://doi.org/10.1016/j.trb.2009.04.004openalex-snapshot
The design of single allocation incomplete hub networks
inferred← citeshttps://doi.org/10.1016/j.trb.2015.02.006openalex-snapshot
The reliable hub-and-spoke design problem: Models and algorithms
inferred← citeshttps://doi.org/10.1016/j.trb.2016.03.005openalex-snapshot
Finding potential hub locations for liner shipping
inferred← citeshttps://doi.org/10.1016/j.trb.2017.01.014openalex-snapshot
Urban intermodal terminals: The entropy maximising facility location problem
inferred← citeshttps://doi.org/10.1016/j.trb.2018.07.003openalex-snapshot
Shipment scheduling in hub location problems
inferred← citeshttps://doi.org/10.1016/j.tre.2007.01.006openalex-snapshot
Optimal cargo container loading plans under stochastic demands for air express carriers
inferred← citeshttps://doi.org/10.1016/j.tre.2011.04.009openalex-snapshot
Hub location problems in transportation networks
inferred← citeshttps://doi.org/10.1016/j.tre.2015.11.005openalex-snapshot
Interregional trade network analysis for road freight transport in Greece
inferred← citeshttps://doi.org/10.1016/j.tre.2017.11.007openalex-snapshot
Systematic optimization of port clusters along the Maritime Silk Road in the context of industry transfer and production capacity constraints
inferred← citeshttps://doi.org/10.1016/j.tre.2018.03.008openalex-snapshot
Locating transit hubs in a multi-modal transportation network: A cluster-based optimization approach
inferred← citeshttps://doi.org/10.1016/j.tre.2018.09.002openalex-snapshot
Joint design of fleet size, hub locations, and hub capacities for third-party logistics networks with road congestion constraints
inferred← citeshttps://doi.org/10.1016/j.tre.2019.09.002openalex-snapshot
Canal effects on a liner hub location problem
inferred← citeshttps://doi.org/10.1016/s0305-0548(01)00080-6openalex-snapshot
HubLocator: an exact solution method for the multiple allocation hub location problem
inferred← citeshttps://doi.org/10.1016/s0305-0548(02)00052-7openalex-snapshot
Location models for airline hubs behaving as M/D/c queues
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00286-5openalex-snapshot
A hybrid heuristic for the uncapacitated hub location problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00195-7openalex-snapshot
Location of hubs in a competitive environment
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00395-6openalex-snapshot
The capacitated multiple allocation hub location problem: Formulations and algorithms
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00370-7openalex-snapshot
Solving large single allocation p-hub problems with two or three hubs
inferred← citeshttps://doi.org/10.1016/s0927-0507(06)14008-6openalex-snapshot
Chapter 8 Intermodal Transportation
inferred← citeshttps://doi.org/10.1016/s0966-8349(96)00010-1openalex-snapshot
A dual algorithm for the uncapacitated hub location problem
inferred← citeshttps://doi.org/10.1016/s0966-8349(96)00011-3openalex-snapshot
Efficient algorithms for the uncapacitated single allocation p-hub median problem
inferred← citeshttps://doi.org/10.1016/s0966-8349(96)00015-0openalex-snapshot
Hub network design with single and multiple allocation: A computational study
inferred← citeshttps://doi.org/10.1051/ro/2020125openalex-snapshot
Hub location problem in round-trip service applications
inferred← citeshttps://doi.org/10.1051/ro/2021155openalex-snapshot
Robust sustainable multi-period hub location considering uncertain time-dependent demand
inferred← citeshttps://doi.org/10.1057/jors.2008.92openalex-snapshot
A hub covering network design problem for cargo applications in Turkey
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2602307openalex-snapshot
The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
inferred← citeshttps://doi.org/10.1061/41127(382)442openalex-snapshot
The Design of Uncapacitated Single Allocation Hub-and-Spoke Networks Using a Hybrid Algorithm
inferred← citeshttps://doi.org/10.1080/02533839.2013.781797openalex-snapshot
A threshold accepting algorithm for the uncapacitated single allocation hub location problem
inferred← citeshttps://doi.org/10.1080/03081060601075674openalex-snapshot
Cargo Container Loading Plan Model and Solution Method for International Air Express Carriers
inferred← citeshttps://doi.org/10.1080/10556788.2023.2196726openalex-snapshot
An efficient model for the multiple allocation hub maximal covering problem
inferred← citeshttps://doi.org/10.1080/13675567.2013.814623openalex-snapshot
Reliability analysis of network design for a hub-and-spoke air cargo network
inferred← citeshttps://doi.org/10.1080/18128600808685680openalex-snapshot
AIRLINE NETWORK DESIGN PROBLEM WITH DIFFERENT AIRPORT CAPACITY CONSTRAINTS
inferred← citeshttps://doi.org/10.1080/18128600902906755openalex-snapshot
A two-stage stochastic model for airline network design with uncertain demand
inferred← citeshttps://doi.org/10.1093/jeg/lbr028openalex-snapshot
Increasing returns in transportation and the formation of hubs
inferred← citeshttps://doi.org/10.1108/14654659910280929openalex-snapshot
Network design in supply chain management
inferred← citeshttps://doi.org/10.1109/access.2020.2983423openalex-snapshot
Hierarchical Multimodal Hub Location With Time Restriction for China Railway (CR) Express Network
inferred← citeshttps://doi.org/10.1109/cec.2010.5586382openalex-snapshot
An efficient genetic algorithm for the uncapacitated single allocation hub location problem
inferred← citeshttps://doi.org/10.1109/cymaen50288.2021.9497308openalex-snapshot
Capacitated multiple allocation incomplete hub location problem allowing direct links between non-hub nodes
inferred← citeshttps://doi.org/10.1109/soli.2009.5203941openalex-snapshot
Air freight service network design for stochastic demand
inferred← citeshttps://doi.org/10.1111/gean.12075openalex-snapshot
Hub Location Problem with Allowed Routing between Nonhub Nodes
inferred← citeshttps://doi.org/10.1111/itor.12993openalex-snapshot
On hub location problems in geographically flexible networks
inferred← citeshttps://doi.org/10.1111/j.0033-0124.1994.00468.xopenalex-snapshot
A Method for the Exploratory Analysis of Airline Networks
inferred← citeshttps://doi.org/10.11175/easts.6.2921openalex-snapshot
THE ECONOMIC EVALUATION OF INTERCITY INTERMODAL LOGISTICS
inferred← citeshttps://doi.org/10.1142/s021926591940005xopenalex-snapshot
A Survey of Hub Location Problems
inferred← citeshttps://doi.org/10.1177/03611981221101391openalex-snapshot
Combined Hub Location and Service Network Design Problem: A Case Study for an Intermodal Rail Operator and Structural Analysis
inferred← citeshttps://doi.org/10.1177/2399808320987093openalex-snapshot
A data-driven complex network approach for planning sustainable and inclusive urban mobility hubs and services
inferred← citeshttps://doi.org/10.1287/ijoc.10.2.149openalex-snapshot
An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
inferred← citeshttps://doi.org/10.1287/opre.1120.1065openalex-snapshot
Release Time Scheduling and Hub Location for Next-Day Delivery
inferred← citeshttps://doi.org/10.1287/opre.2014.1263openalex-snapshot
Hub Location as the Minimization of a Supermodular Set Function
inferred← citeshttps://doi.org/10.1287/trsc.1100.0326openalex-snapshot
The Dynamic Uncapacitated Hub Location Problem
inferred← citeshttps://doi.org/10.1287/trsc.2017.0751openalex-snapshot
Solving Single Allocation Hub Location Problems on Euclidean Data
inferred← citeshttps://doi.org/10.15807/jorsj.40.62openalex-snapshot
ON THE AIRLINE HUB PROBLEM : THE CONTINUOUS MODEL
inferred← citeshttps://doi.org/10.2208/jscej.2004.139openalex-snapshot
MULTILEVEL HIERARCHICAL NETWORK DESIGN
inferred← citeshttps://doi.org/10.22158/asir.v7n2p158openalex-snapshot
Modeling and Solving a Linear Integer Problem (PLNE) for the Optimal Localization of a Hub Air Transport in the WAEMU Zone
inferred← citeshttps://doi.org/10.23919/mipro48935.2020.9245087openalex-snapshot
Determining the location of postal centers in B&H using machine learning clustering method and GIS
inferred← citeshttps://doi.org/10.24406/publica-fhg-293957openalex-snapshot
New approaches to hub location problems in public transport planning
inferred← citeshttps://doi.org/10.3141/2042-12openalex-snapshot
Cluster-Based Optimization of Urban Transit Hub Locations
inferred← citeshttps://doi.org/10.3141/2112-02openalex-snapshot
Cluster-Based Hierarchical Model for Urban Transit Hub Location Planning
inferred← citeshttps://doi.org/10.3390/a16080379openalex-snapshot
A Multi-Objective Tri-Level Algorithm for Hub-and-Spoke Network in Short Sea Shipping Transportation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.