On the public citation graph
Avoiding local optima in thep-hub location problem using tabu search and GRASP
0 signed · 239 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.1007/bf02023611openalex-snapshot
Interactive decision software and computer graphics for architectural and space planning
inferredcites →https://doi.org/10.1007/bf02239976openalex-snapshot
Using tabu search techniques for graph coloring
inferredcites →https://doi.org/10.1007/bf02739239openalex-snapshot
Interactive decision software and computer graphics for architectural and space planning
inferredcites →https://doi.org/10.1016/0167-6377(87)90021-6openalex-snapshot
Semi-greedy heuristics: An empirical study
inferredcites →https://doi.org/10.1016/0167-6377(89)90002-3openalex-snapshot
A probabilistic heuristic for a computationally difficult set covering problem
inferredcites →https://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot
Future paths for integer programming and links to artificial intelligence
inferredcites →https://doi.org/10.1016/0305-0548(86)90050-xopenalex-snapshot
The general employee scheduling problem. An integration of MS and AI
inferredcites →https://doi.org/10.1016/0377-2217(89)90185-9openalex-snapshot
New approaches for heuristic search: A bilateral linkage with artificial intelligence
inferredcites →https://doi.org/10.1016/0377-2217(90)90018-7openalex-snapshot
On “a quadratic integer program for the location of interacting hub facilities”
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/s0377-2217(87)80007-3openalex-snapshot
A quadratic integer program for the location of interacting hub facilities
inferredcites →https://doi.org/10.1080/07408179108963843openalex-snapshot
An Algorithm for the Manufacturing Equipment Selection Problem
inferredcites →https://doi.org/10.1109/jsac.1986.1146400openalex-snapshot
Backbone Network Design and Performance Analysis: A Methodology for Packet Switching Networks
inferredcites →https://doi.org/10.1109/tcom.1977.1093708openalex-snapshot
Large-Scale Network Topological Optimization
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.1111/j.1540-5915.1977.tb01074.xopenalex-snapshot
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
inferredcites →https://doi.org/10.1126/science.22.569.671openalex-snapshot
The Central Association of Science and Mathematics Teachers
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1287/ijoc.2.1.33openalex-snapshot
Tabu Search Applied to the Quadratic Assignment Problem
inferredcites →https://doi.org/10.1287/mnsc.35.12.1415openalex-snapshot
Flight Scheduling and Maintenance Base Planning
inferredcites →https://doi.org/10.1287/mnsc.35.2.249openalex-snapshot
Note—Operations Sequencing in Discrete Parts Manufacturing
inferredcites →https://doi.org/10.1287/mnsc.35.6.645openalex-snapshot
An Overview of Representative Problems in Location Research
inferredcites →https://doi.org/10.1287/opre.37.1.12openalex-snapshot
OR Practice—Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry
inferredcites →https://doi.org/10.1287/opre.37.6.865openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
inferredcites →https://doi.org/10.1287/opre.42.5.860openalex-snapshot
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
inferredcites →https://doi.org/10.1287/trsc.20.2.92openalex-snapshot
The Location of Interacting Hub Facilities
inferredcites →https://doi.org/10.2307/2583404openalex-snapshot
Facilities Location: Models and Methods
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.394924openalex-extracted
Location of Multiple Server Common Service Centers or Public Facilities for Minimizing General Congestion and Travel Cost Functions
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200001)35:1<17::aid-net2>3.0.co;2-nopenalex-snapshot
The single allocation problem in the interacting three-hub network
inferred← citeshttps://doi.org/10.1002/1520-6750(199412)41:7<893::aid-nav3220410704>3.0.co;2-ropenalex-snapshot
Using grasp to solve the component grouping problem
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0281openalex-snapshot
Effective Application of GRASP
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/0-306-48056-5_8openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_188openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_405openalex-snapshot
Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/11546245_13openalex-snapshot
A Hybrid GRASP-Path Relinking Algorithm for the Capacitated p – hub Median Problem
inferred← citeshttps://doi.org/10.1007/11816157_90openalex-snapshot
Two Artificial Intelligence Heuristics in Solving Multiple Allocation Hub Maximal Covering Problem
inferred← citeshttps://doi.org/10.1007/3-540-44869-1_93openalex-snapshot
A recurrent neural network model for the p-hub problem
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_4openalex-snapshot
Metaheuristics and Applications to Optimization Problems in Telecommunications
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_256openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_534openalex-snapshot
Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-74905-1_14openalex-snapshot
A Heuristic for the Capacitated Single Allocation Hub Location Problem
inferred← citeshttps://doi.org/10.1007/978-1-4419-1153-7_1152openalex-snapshot
Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-1-4419-1665-5_10openalex-snapshot
Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications
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-1-4613-0233-9_4openalex-snapshot
Combinatorial Optimization in Telecommunications
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_27openalex-snapshot
The Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-1-4614-6940-7_11openalex-snapshot
GRASP: Greedy Randomized Adaptive Search Procedures
inferred← citeshttps://doi.org/10.1007/978-1-4615-1507-4_15openalex-snapshot
Grasp: An Annotated Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-030-00898-7_21openalex-snapshot
Optimising Routing in an Agent-Centric Synchromodal Network with Shared Information
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_256-1openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_534-1openalex-snapshot
Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-13048-8_4openalex-snapshot
DCTA: Dynamic Cauchy Tumbleweed Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-91086-4_6openalex-snapshot
Greedy Randomized Adaptive Search Procedures: Advances and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-540-24652-7_16openalex-snapshot
On the Use of Path Relinking for the ρ – Hub Median Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-25945-9_11openalex-snapshot
A Recurrent Neural Network for Airport Scales Location
inferred← citeshttps://doi.org/10.1007/978-3-540-45157-0_15openalex-snapshot
GRASPing the Examination Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-56082-8_3openalex-snapshot
Discrete Network Location Models
inferred← citeshttps://doi.org/10.1007/978-94-011-4748-4_28openalex-snapshot
Improvements in Local Disaster Management
inferred← citeshttps://doi.org/10.1007/bf01096763openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferred← citeshttps://doi.org/10.1007/bf01434269openalex-snapshot
Hub facility location with fixed costs
inferred← citeshttps://doi.org/10.1007/bf02060486openalex-snapshot
A clustering approach to the planar hub location problem
inferred← citeshttps://doi.org/10.1007/bf02125455openalex-snapshot
Tabu search for graph partitioning
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/s00500-022-07302-6openalex-snapshot
RETRACTED ARTICLE: Sustainable multi-period hub location under uncertainty
inferred← citeshttps://doi.org/10.1007/s10479-017-2656-3openalex-snapshot
Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
inferred← citeshttps://doi.org/10.1007/s10479-017-2680-3openalex-snapshot
Dynamic temporary blood facility location-allocation during and post-disaster periods
inferred← citeshttps://doi.org/10.1007/s10479-023-05479-zopenalex-snapshot
Assessing the benefits of storage and transshipments yards in timber supply chains by a column generation + grasp approach
inferred← citeshttps://doi.org/10.1007/s10589-007-9069-1openalex-snapshot
Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
inferred← citeshttps://doi.org/10.1007/s10589-026-00798-wopenalex-snapshot
Learning to locate p-hubs in situations of changes in flow
inferred← citeshttps://doi.org/10.1007/s10669-023-09933-yopenalex-snapshot
Optimisation of selection and placement of nature-based solutions for climate adaptation: a literature review on the modelling and resolution approaches
inferred← citeshttps://doi.org/10.1007/s11042-024-19509-wopenalex-snapshot
Deadline-aware and energy efficient IoT task scheduling using fuzzy logic in fog computing
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/s11081-025-10022-zopenalex-snapshot
Capacitated p-hub approach for park-and-ride facility location problem under nested logit demand function: polyhedral approaches
inferred← citeshttps://doi.org/10.1007/s11235-010-9289-zopenalex-snapshot
GRASP: basic components and enhancements
inferred← citeshttps://doi.org/10.1007/s11750-024-00685-9openalex-snapshot
General variable neighborhood search for the capacitated single allocation hub maximal covering problem
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-00767-9openalex-snapshot
Sustainable hierarchical multi-modal hub network design problem: bi-objective formulations and solution algorithms
inferred← citeshttps://doi.org/10.1007/s12652-022-03879-wopenalex-snapshot
Hybrid solution methods for a continuous-time multi-period hub location problem with time-dependent demand and sustainability considerations
inferred← citeshttps://doi.org/10.1007/s13675-016-0076-9openalex-snapshot
Matheuristics for optimizing the network in German wagonload traffic
inferred← citeshttps://doi.org/10.1007/s13676-019-00141-wopenalex-snapshot
The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach
inferred← citeshttps://doi.org/10.1016/0191-2615(93)90018-6openalex-snapshot
Continuous and discrete demand hub location problems
inferred← citeshttps://doi.org/10.1016/0305-0548(91)90001-8openalex-snapshot
A GRASP™ for a difficult single machine scheduling problem
inferred← citeshttps://doi.org/10.1016/0305-0548(95)00084-4openalex-snapshot
A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
inferred← citeshttps://doi.org/10.1016/0377-2217(93)e0173-uopenalex-snapshot
The hub location and routing problem
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90245-3openalex-snapshot
On tabu search for the location of interacting hub facilities
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/0377-2217(95)00100-xopenalex-snapshot
Tight linear programming relaxations of uncapacitated p-hub median problems
inferred← citeshttps://doi.org/10.1016/0966-6923(94)90032-9openalex-snapshot
The hub network design problem
inferred← citeshttps://doi.org/10.1016/0966-8349(96)00003-4openalex-snapshot
Subdrop: A modified drop heuristic for location problems
inferred← citeshttps://doi.org/10.1016/j.aei.2024.102974openalex-snapshot
Multi-objective hub location for urban air mobility via self-adaptive evolutionary algorithm
inferred← citeshttps://doi.org/10.1016/j.apm.2011.10.016openalex-snapshot
A fuzzy programming approach for dynamic virtual hub location problem
inferred← citeshttps://doi.org/10.1016/j.apm.2013.05.063openalex-snapshot
Solving a new stochastic multi-mode p -hub covering location problem considering risk by a novel multi-objective algorithm
inferred← citeshttps://doi.org/10.1016/j.cie.2011.12.006openalex-snapshot
A hub location inventory model for bicycle sharing system design: Formulation and solution
inferred← citeshttps://doi.org/10.1016/j.cie.2012.03.014openalex-snapshot
Uncapacitated single allocation p-hub maximal covering problem
inferred← citeshttps://doi.org/10.1016/j.cie.2013.01.012openalex-snapshot
Hub location problems: A review of models, classification, solution techniques, and applications
inferred← citeshttps://doi.org/10.1016/j.cie.2017.12.020openalex-snapshot
The capacitated hub covering location-routing problem for simultaneous pickup and delivery systems
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.08.027openalex-snapshot
Metaheuristics for optimization problems in computer communications
inferred← citeshttps://doi.org/10.1016/j.cor.2003.11.016openalex-snapshot
Hub-and-spoke network design with congestion
inferred← citeshttps://doi.org/10.1016/j.cor.2005.02.030openalex-snapshot
Bounds for the single source modular capacitated plant location problem
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.2013.01.008openalex-snapshot
Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
inferred← citeshttps://doi.org/10.1016/j.cor.2014.09.003openalex-snapshot
A genetic algorithm for the uncapacitated single allocation planar hub location problem
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106173openalex-snapshot
A parallel adaptive memory algorithm for the capacitated modular hub location problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100672openalex-snapshot
Mathematical formulations and solution methods for the uncapacitated r -allocation p -hub maximal covering problem
inferred← citeshttps://doi.org/10.1016/j.dss.2003.12.006openalex-snapshot
Decision Support System induced guidance for model formulation and solution
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.2006.06.056openalex-snapshot
Two genetic algorithms for solving the uncapacitated single allocation p-hub median 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.2010.02.022openalex-snapshot
A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.09.017openalex-snapshot
Hub location–allocation in intermodal logistic networks
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.2017.03.066openalex-snapshot
A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.07.015openalex-snapshot
A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands
inferred← citeshttps://doi.org/10.1016/j.engappai.2015.12.009openalex-snapshot
A game-based meta-heuristic for a fuzzy bi-objective reliable hub location problem
inferred← citeshttps://doi.org/10.1016/j.jnca.2022.103333openalex-snapshot
Deadline-aware and energy-efficient IoT task scheduling in fog computing systems: A semi-greedy approach
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.jtte.2023.07.014openalex-snapshot
A VNS-NPGA approach to multi-objective optimization of hub-and-spoke logistics network
inferred← citeshttps://doi.org/10.1016/j.mcm.2006.08.012openalex-snapshot
Routing, ship size, and sailing frequency decision-making for a maritime hub-and-spoke container network
inferred← citeshttps://doi.org/10.1016/j.mcm.2011.06.038openalex-snapshot
An M/M/c queue model for hub covering location problem
inferred← citeshttps://doi.org/10.1016/j.omega.2005.05.004openalex-snapshot
A hybrid heuristic for the uncapacitated single allocation hub location problem
inferred← citeshttps://doi.org/10.1016/j.trb.2009.01.005openalex-snapshot
The hierarchical hub median problem with single assignment
inferred← citeshttps://doi.org/10.1016/j.tre.2008.12.003openalex-snapshot
Optimal rail-road container terminal locations on the European network
inferred← citeshttps://doi.org/10.1016/j.tre.2010.02.003openalex-snapshot
Intermodal logistics: The interplay of financial, operational and service issues
inferred← citeshttps://doi.org/10.1016/j.tre.2010.09.004openalex-snapshot
Strategic design of public bicycle sharing systems with service level constraints
inferred← citeshttps://doi.org/10.1016/s0038-0121(98)00005-6openalex-snapshot
On optimal location with threshold requirements
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(00)00114-4openalex-snapshot
Dual-based approach for a hub network design problem under non-restrictive policy
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00141-5openalex-snapshot
An efficient tabu search procedure for the p-Median Problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00233-0openalex-snapshot
A linear program for the two-hub location problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00183-5openalex-snapshot
Some personal views on the current state and the future of locational analysis
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00201-4openalex-snapshot
Efficient solution procedure and reduced size formulations for p-hub location problems
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(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)00017-4openalex-snapshot
Neural versus traditional approaches to the location of interacting hub facilities
inferred← citeshttps://doi.org/10.1016/s0966-8349(97)83422-5openalex-snapshot
The hub location and routing problem
inferred← citeshttps://doi.org/10.1016/s0966-8349(98)00042-4openalex-snapshot
Hub location in backbone/tributary network design: a review
inferred← citeshttps://doi.org/10.1017/s0890060417000221openalex-snapshot
Hybrid ant colony optimization for capacitated multiple-allocation cluster hub location problem
inferred← citeshttps://doi.org/10.1023/a:1008287028851openalex-snapshot
A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems
inferred← citeshttps://doi.org/10.1023/a:1009677613792openalex-snapshot
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
inferred← citeshttps://doi.org/10.1023/a:1011053230283openalex-snapshot
A solution to the hub center problem via a single-relocation algorithm with tabu search
inferred← citeshttps://doi.org/10.1023/a:1018954217758openalex-snapshot
Solution approaches to hub location problems
inferred← citeshttps://doi.org/10.1023/a:1018994432663openalex-snapshot
Solution algorithms for the capacitated single allocation hub location problem
inferred← citeshttps://doi.org/10.1023/a:1020715517162openalex-snapshot
Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale
inferred← citeshttps://doi.org/10.1023/a:1026194423072openalex-snapshot
A New Chance-Constrained Maximum Capture Location Problem
inferred← citeshttps://doi.org/10.1051/e3sconf/202564802014openalex-snapshot
Urban Rail Hub Planning: A Case Study of Bangkok BTS
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.2010.134openalex-snapshot
Applying GRASP to solve the multi-item three-echelon uncapacitated facility location problem
inferred← citeshttps://doi.org/10.1061/41139(387)399openalex-snapshot
Optimal Logistics Hubs Locations on the Multimodal Transportation Network
inferred← citeshttps://doi.org/10.1080/01605682.2026.2648090openalex-snapshot
The multi-objective green p-hub centre routeing problem with hub congestion: Mathematical formulation and hybrid meta-heuristic
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/02533839.2015.1101616openalex-snapshot
A fast variable neighborhood search for p-hub median problem using social network analysis concepts
inferred← citeshttps://doi.org/10.1080/09720510.2001.10701046openalex-snapshot
An investigation into the effect of a more accurate measure of distance on the detailed facility layout problem
inferred← citeshttps://doi.org/10.1080/10170660609509333openalex-snapshot
A HEURISTIC FOR THE UNCAPACITATED MULTIPLE ALLOCATION HUB LOCATION PROBLEM
inferred← citeshttps://doi.org/10.1080/10170660809509068openalex-snapshot
A NOTE ON SOLUTION OF THE UNCAPACITATED SINGLE ALLOCATIONP-HUB MEDIAN PROBLEM
inferred← citeshttps://doi.org/10.1080/17509653.2021.1905096openalex-snapshot
A constraint programming approach and a hybrid of genetic and K-means algorithms to solve the p-hub location-allocation problems
inferred← citeshttps://doi.org/10.1080/19427867.2025.2599216openalex-snapshot
Hub-and-spoke network design problem with multiple modes of transport
inferred← citeshttps://doi.org/10.1080/23302674.2025.2527869openalex-snapshot
Designing an economies-of-scale hub-and-spoke network with congestion and interruption risks in hubs
inferred← citeshttps://doi.org/10.1080/24694452.2025.2482105openalex-snapshot
An Efficient Approach for Solving Hub Location Problems Using Network Autocorrelation Structures
inferred← citeshttps://doi.org/10.1090/dimacs/016/12openalex-snapshot
A greedy randomized adaptive search procedure for the quadratic assignment problem
inferred← citeshttps://doi.org/10.1108/09600030110389532openalex-snapshot
Using simulated annealing to solve the p‐Hub Median Problem
inferred← citeshttps://doi.org/10.1108/14654659910280929openalex-snapshot
Network design in supply chain management
inferred← citeshttps://doi.org/10.1108/ijppm-09-2023-0514openalex-snapshot
Advances in hub location problems: a literature review and research agenda
inferred← citeshttps://doi.org/10.1109/ams.2010.132openalex-snapshot
Hub Covering Location Problem under Capacity Constraints
inferred← citeshttps://doi.org/10.1109/dasa59624.2023.10286670openalex-snapshot
Hub Location Problems: Classification and Bibliometric Analysis of Relevant Works
inferred← citeshttps://doi.org/10.1109/etfa.1999.815420openalex-snapshot
Design of telecommunication networks
inferred← citeshttps://doi.org/10.1109/icieem.2011.6035276openalex-snapshot
A mathematical programming approach for bi-levels tree hub location network
inferred← citeshttps://doi.org/10.1109/icmsao.2011.5775615openalex-snapshot
Genetic and hybrid shuffled frog leaping algorithms for solving a 2-stage model for a hub covering location network
inferred← citeshttps://doi.org/10.1111/coin.12374openalex-snapshot
Capacitated single‐allocation hub location model for a flood relief distribution network
inferred← citeshttps://doi.org/10.1111/dsji.12027openalex-snapshot
Team Machine: A Decision Support System for Team Formation
inferred← citeshttps://doi.org/10.1111/j.1435-5597.1992.tb01848.xopenalex-snapshot
HUB FACILITY LOCATION WITH FIXED COSTS
inferred← citeshttps://doi.org/10.1111/j.1435-5597.2001.tb01213.xopenalex-snapshot
Consumer choice and optimal locations models: Formulations and heuristics
inferred← citeshttps://doi.org/10.1111/j.1435-5957.2009.00255.xopenalex-snapshot
Market area of intermodal rail‐road container terminals embedded in a hub‐and‐spoke network
inferred← citeshttps://doi.org/10.11175/eastpro.2009.0.149.0openalex-snapshot
A Threshold Accepting Algorithm for the Uncapacitated Single Allocation p-Hub Median Problem
inferred← citeshttps://doi.org/10.11175/easts.10.851openalex-snapshot
Lagrangian Relaxation for the Capacitated Single Allocation p-Hub Median Problem
inferred← citeshttps://doi.org/10.11175/easts.11.819openalex-snapshot
Reactive GRASP for the Capacitated Single Allocation p-Hub Median Problem
inferred← citeshttps://doi.org/10.1142/s0219622003000835openalex-snapshot
A GRASP HEURISTIC FOR SOLVING AN EXTENDED CAPACITATED CONCENTRATOR LOCATION PROBLEM
inferred← citeshttps://doi.org/10.1155/s117391260300018xopenalex-snapshot
Genetic Algorithm for Network Cost Minimization Using Threshold Based Discounting
inferred← citeshttps://doi.org/10.11591/ijece.v11i3.pp2293-2306openalex-snapshot
An artificial immune system algorithm for solving the uncapacitated single allocation p-Hub median problem
inferred← citeshttps://doi.org/10.1177/0160017611403738openalex-snapshot
Location of Multiple-Server Common Service Centers or Facilities, for Minimizing General Congestion and Travel Cost Functions
inferred← citeshttps://doi.org/10.1177/03611981221105501openalex-snapshot
Solving Hub Location Problems With Profits Using Variable Neighborhood Search
inferred← citeshttps://doi.org/10.1177/21582440251324335openalex-snapshot
A Bi-Objective Mathematical Programming Model for a Maximal Covering Hub Location Problem Under Uncertainty
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/ijoc.1090.0335openalex-snapshot
A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
inferred← citeshttps://doi.org/10.1287/ijoo.2019.0031openalex-snapshot
Spatial Separability in Hub Location Problems with an Application to Brain Connectivity Networks
inferred← citeshttps://doi.org/10.1287/mnsc.1050.0406openalex-snapshot
Hub Arc Location Problems: Part I—Introduction and Results
inferred← citeshttps://doi.org/10.1287/mnsc.41.4.713openalex-snapshot
Lower Bounds for the Hub Location Problem
inferred← citeshttps://doi.org/10.1287/mnsc.44.12.s235openalex-snapshot
An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
inferred← citeshttps://doi.org/10.1287/opre.42.4.677openalex-snapshot
A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
inferred← citeshttps://doi.org/10.1287/opre.42.5.860openalex-snapshot
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
inferred← citeshttps://doi.org/10.1287/opre.44.6.923openalex-snapshot
Hub Location and the p-Hub Median Problem
inferred← citeshttps://doi.org/10.1287/trsc.1030.0064openalex-snapshot
Designing Distribution Networks: Formulations and Solution Heuristic
inferred← citeshttps://doi.org/10.1287/trsc.2016.0679openalex-snapshot
Reliable Hub Network Design: Formulation and Solution Techniques
inferred← citeshttps://doi.org/10.1287/trsc.2018.0871openalex-snapshot
Heuristic Solutions for a Class of Stochastic Uncapacitated p-Hub Median Problems
inferred← citeshttps://doi.org/10.1287/trsc.29.1.4openalex-snapshot
The Airline Exception Scheduling Problem
inferred← citeshttps://doi.org/10.1287/trsc.29.3.201openalex-snapshot
Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
inferred← citeshttps://doi.org/10.14295/transportes.v12i1.124openalex-snapshot
Configuração de redes do tipo hub-and-spoke para o transporte rodoviário de carga parcelada no Brasil utilizando algoritmos genéticos
inferred← citeshttps://doi.org/10.1504/ijads.2010.036849openalex-snapshot
Applying GRASP meta-heuristic to solve the single-item two-echelon uncapacitated facility location problem
inferred← citeshttps://doi.org/10.1504/ijmheur.2012.048213openalex-snapshot
A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
inferred← citeshttps://doi.org/10.15807/jorsj.40.62openalex-snapshot
ON THE AIRLINE HUB PROBLEM : THE CONTINUOUS MODEL
inferred← citeshttps://doi.org/10.15807/jorsj.44.390openalex-snapshot
STACKELBERG HUB LOCATION PROBLEM
inferred← citeshttps://doi.org/10.1590/s0101-74382000000100006openalex-snapshot
GRASP para o PQA: um limite de aceitação para soluções iniciais
inferred← citeshttps://doi.org/10.1590/s0101-74382012005000024openalex-snapshot
Addressing congestion on single allocation hub-and-spoke networks
inferred← citeshttps://doi.org/10.17077/etd.78u2efyqopenalex-snapshot
The hub covering flow problem and the stochastic p-hub center problem
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.23841/egsk.2009.12.4.540openalex-snapshot
Reliable Hub Location Problems and Network Design
inferred← citeshttps://doi.org/10.3141/2269-03openalex-snapshot
Centralized Carrier Collaboration Multihub Location Problem for Less-Than-Truckload Industry
inferred← citeshttps://doi.org/10.3141/2466-03openalex-snapshot
Capacitated Centralized Carrier Collaboration Multihub Location Problem
inferred← citeshttps://doi.org/10.3390/math13111704openalex-snapshot
Optimizing Route Planning via the Weighted Sum Method and Multi-Criteria Decision-Making
inferred← citeshttps://doi.org/10.3390/polym16121752openalex-snapshot
A Multi-Objective Optimization of Neural Networks for Predicting the Physical Properties of Textile Polymer Composite Materials
showing the first 200 of 210 · page through all 210
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.