On the public citation graph
A branch-and-cut algorithm for the hub location and routing problem
0 signed · 153 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/net.20019openalex-snapshot
Projecting the flow variables for hub location problems
inferredcites →https://doi.org/10.1002/net.20193openalex-snapshot
Solving the hub location problem in a star–star network
inferredcites →https://doi.org/10.1007/978-1-4757-3357-0openalex-snapshot
Mathematical Methods on Optimization in Transportation Systems
inferredcites →https://doi.org/10.1007/978-1-4757-3357-0_6openalex-snapshot
Hub Location Problems in Urban Traffic Networks
inferredcites →https://doi.org/10.1007/bf02023807openalex-snapshot
An exact algorithm for solving a capacitated location-routing problem
inferredcites →https://doi.org/10.1007/bf02564791openalex-snapshot
The many-to-many location-routing problem
inferredcites →https://doi.org/10.1007/s002910050106openalex-snapshot
Restructuring of Swiss parcel delivery services
inferredcites →https://doi.org/10.1007/s10107-002-0336-8openalex-snapshot
Multistars, partial multistars and the capacitated vehicle routing problem
inferredcites →https://doi.org/10.1007/s10107-004-0531-xopenalex-snapshot
A branch and cut algorithm for hub location problems with single assignment
inferredcites →https://doi.org/10.1007/s10107-008-0218-9openalex-snapshot
A unified exact method for solving different classes of vehicle routing problems
inferredcites →https://doi.org/10.1007/s10479-010-0705-2openalex-snapshot
Hubbing and routing in postal delivery systems
inferredcites →https://doi.org/10.1016/0377-2217(81)90212-5openalex-snapshot
An exact algorithm for minimizing routing and operating costs in depot location
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(93)e0173-uopenalex-snapshot
The hub location and routing 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/0377-2217(95)00100-xopenalex-snapshot
Tight linear programming relaxations of uncapacitated p-hub median problems
inferredcites →https://doi.org/10.1016/0966-6923(94)90032-9openalex-snapshot
The hub network design problem
inferredcites →https://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
inferredcites →https://doi.org/10.1016/j.cor.2007.01.014openalex-snapshot
Star p-hub median problem with modular arc capacities
inferredcites →https://doi.org/10.1016/j.cor.2008.11.023openalex-snapshot
A tabu-search based heuristic for the hub covering problem over incomplete hub networks
inferredcites →https://doi.org/10.1016/j.cor.2010.07.014openalex-snapshot
A branch-and-cut algorithm for the partitioning-hub location-routing problem
inferredcites →https://doi.org/10.1016/j.cor.2010.09.019openalex-snapshot
A Branch-and-Cut method for the Capacitated Location-Routing Problem
inferredcites →https://doi.org/10.1016/j.cor.2012.02.005openalex-snapshot
Star p-hub center problem and star p-hub median problem with bounded path lengths
inferredcites →https://doi.org/10.1016/j.ejor.2007.06.008openalex-snapshot
Network hub location problems: The state of the art
inferredcites →https://doi.org/10.1016/j.ejor.2009.05.044openalex-snapshot
The Tree of Hubs Location Problem
inferredcites →https://doi.org/10.1016/j.ejor.2011.01.014openalex-snapshot
Allocation strategies in hub networks
inferredcites →https://doi.org/10.1016/j.ejor.2013.12.021openalex-snapshot
Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
inferredcites →https://doi.org/10.1016/j.ijpe.2003.12.002openalex-snapshot
An integrated multi-depot hub-location vehicle routing model for network planning of parcel service
inferredcites →https://doi.org/10.1016/j.trb.2007.03.003openalex-snapshot
The latest arrival hub location problem for cargo delivery systems with stopovers
inferredcites →https://doi.org/10.1016/j.trb.2009.01.005openalex-snapshot
The hierarchical hub median problem with single assignment
inferredcites →https://doi.org/10.1016/j.trb.2009.04.004openalex-snapshot
The design of single allocation incomplete hub networks
inferredcites →https://doi.org/10.1016/j.tre.2012.04.001openalex-snapshot
Hierarchical multimodal hub location problem with time-definite deliveries
inferredcites →https://doi.org/10.1016/s0191-2615(98)00021-6openalex-snapshot
Hub location with flow economies of scale
inferredcites →https://doi.org/10.1016/s0305-0548(03)00245-4openalex-snapshot
A compact model and tight bounds for a combined location-routing problem
inferredcites →https://doi.org/10.1016/s0377-2217(01)00151-5openalex-snapshot
Network cost minimization using threshold-based discounting
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.1016/s0377-2217(99)00370-7openalex-snapshot
Solving large single allocation p-hub problems with two or three hubs
inferredcites →https://doi.org/10.1016/s0966-6923(01)00019-9openalex-snapshot
Embedding economies of scale concepts for hub network design
inferredcites →https://doi.org/10.1016/s0966-8349(96)00011-3openalex-snapshot
Efficient algorithms for the uncapacitated single allocation p-hub median problem
inferredcites →https://doi.org/10.1057/palgrave.jors.2601692openalex-snapshot
A branch-and-cut algorithm for the plant-cycle location problem
inferredcites →https://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
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1287/ijoc.10.2.133openalex-snapshot
Solving the Orienteering Problem through Branch-and-Cut
inferredcites →https://doi.org/10.1287/ijoc.10.2.149openalex-snapshot
An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
inferredcites →https://doi.org/10.1287/mnsc.1050.0406openalex-snapshot
Hub Arc Location Problems: Part I—Introduction and Results
inferredcites →https://doi.org/10.1287/mnsc.1050.0407openalex-snapshot
Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
inferredcites →https://doi.org/10.1287/opre.1110.0965openalex-snapshot
Benders Decomposition for Large-Scale Uncapacitated Hub Location
inferredcites →https://doi.org/10.1287/trsc.1080.0233openalex-snapshot
Benders Decomposition for Hub Location Problems with Economies of Scale
inferredcites →https://doi.org/10.1287/trsc.1120.0410openalex-snapshot
Twenty-Five Years of Hub Location Research
inferredcites →https://doi.org/10.1287/trsc.22.3.161openalex-snapshot
Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
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.4682366openalex-extracted
Deep Reinforcement Learning for a Multi-Objective Sustainable Hub Location-Routing Problem
inferred← citeshttps://doi.org/10.1002/net.21685openalex-snapshot
Heuristics for a hub location‐routing problem
inferred← citeshttps://doi.org/10.1007/978-981-15-0950-6_50openalex-snapshot
An Optimization Model for Coal Procurement Networks with Coal Blending Facilities
inferred← citeshttps://doi.org/10.1007/s00291-018-0526-2openalex-snapshot
Heuristic algorithms for the single allocation p-hub center problem with routing considerations
inferred← citeshttps://doi.org/10.1007/s10479-019-03421-wopenalex-snapshot
Bi-objective load balancing multiple allocation hub location: a compromise programming approach
inferred← citeshttps://doi.org/10.1007/s10489-017-0995-zopenalex-snapshot
Discrete particle swarm optimization algorithms for two variants of the static data segment location problem
inferred← citeshttps://doi.org/10.1007/s10732-021-09477-xopenalex-snapshot
A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem
inferred← citeshttps://doi.org/10.1007/s11590-016-1022-8openalex-snapshot
A capacitated hub location problem in freight logistics multimodal networks
inferred← citeshttps://doi.org/10.1007/s11590-018-1282-6openalex-snapshot
A branch and cut algorithm for the capacitated star–star telecommunication network problem
inferred← citeshttps://doi.org/10.1007/s12351-024-00876-zopenalex-snapshot
Strategic planning for hub resilience: a stochastic location-routing perspective
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.1007/s40092-017-0218-6openalex-snapshot
A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach
inferred← citeshttps://doi.org/10.1007/s43538-025-00538-4openalex-snapshot
Multiobjectivization of the single-allocation hub median problem: an improved genetic algorithm-based approach
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.03.008openalex-snapshot
p-Median based formulations with backbone facility locations
inferred← citeshttps://doi.org/10.1016/j.cie.2017.07.039openalex-snapshot
A multi-objective sustainable hub location-scheduling problem for perishable food supply chain
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.cie.2019.05.038openalex-snapshot
A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106955openalex-snapshot
An efficient and scalable approach to hub location problems based on contraction
inferred← citeshttps://doi.org/10.1016/j.cie.2026.111907openalex-snapshot
A Two-Echelon Single-Allocation incomplete hub location routing problem Arising in multimodal Intra-City express delivery systems
inferred← citeshttps://doi.org/10.1016/j.cor.2015.09.008openalex-snapshot
A branch-and-cut algorithm for two-level survivable network design problems
inferred← citeshttps://doi.org/10.1016/j.cor.2017.06.016openalex-snapshot
The Ring Spur Assignment Problem: New formulation, valid inequalities and a branch-and-cut approach
inferred← citeshttps://doi.org/10.1016/j.cor.2018.07.022openalex-snapshot
A continuous approximation approach to the planar hub location-routing problem: Modeling and solution algorithms
inferred← citeshttps://doi.org/10.1016/j.cor.2018.09.011openalex-snapshot
HUBBI: Iterative network design for incomplete hub location problems
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105469openalex-snapshot
Planning and design of intermodal hub networks: A literature review
inferred← citeshttps://doi.org/10.1016/j.cor.2022.105923openalex-snapshot
A fuzzy correlation based heuristic for Dual-mode integrated Location routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2022.105959openalex-snapshot
Hub location problem considering spoke links with incentive-dependent capacities
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106252openalex-snapshot
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106426openalex-snapshot
A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106558openalex-snapshot
Modeling and solving the two-level generalized median tour problem
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106861openalex-snapshot
A literature review on hub location-routing models and their solution techniques
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107291openalex-snapshot
Machine learning-enriched distributionally robust optimization and hybrid decomposition to joint optimization of transportation hub network design and pricing
inferred← citeshttps://doi.org/10.1016/j.eastsj.2024.100147openalex-snapshot
An enhanced Modelling approach for warehouse sharing platform system designing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.08.030openalex-snapshot
A survey of variants and extensions of the location-routing problem
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.2020.09.039openalex-snapshot
Perspectives on modeling hub location problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.11.021openalex-snapshot
The capacitated directed cycle hub location and routing problem under congestion
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.02.002openalex-snapshot
Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.02.003openalex-snapshot
Multi-period single-allocation hub location-routing: Models and heuristic solutions
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.05.006openalex-snapshot
Capacitated hub location routing problem with time windows and stochastic demands for the design of intra-city express systems
inferred← citeshttps://doi.org/10.1016/j.endm.2016.03.030openalex-snapshot
Hierarchical Survivable Network Design Problems
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.02.058openalex-snapshot
Two-echelon logistics distribution region partitioning problem based on a hybrid particle swarm optimization–genetic algorithm
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.120598openalex-snapshot
An exact algorithm for Two-Echelon Location-Routing problem with simultaneous pickup and delivery
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.06.080openalex-snapshot
A Local Search approach for the Two–Echelon Multi-products Location–Routing problem with Pickup and Delivery
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.08.281openalex-snapshot
A VNDS Approach for the Liner Shipping Transport in a Structure of Hub-and-Spoke with Sub-Hub
inferred← citeshttps://doi.org/10.1016/j.jatrs.2025.100073openalex-snapshot
Hub location problems: A meta review and ten disruptive research challenges
inferred← citeshttps://doi.org/10.1016/j.omega.2024.103220openalex-snapshot
The role of hubs and economies of scale in network expansion
inferred← citeshttps://doi.org/10.1016/j.seps.2023.101563openalex-snapshot
Adaptive distributionally robust hub location and routing problem with a third-party logistics strategy
inferred← citeshttps://doi.org/10.1016/j.tre.2014.12.016openalex-snapshot
Multi-period hub location problems in transportation
inferred← citeshttps://doi.org/10.1016/j.tre.2016.04.006openalex-snapshot
Fair profit contract for a carrier collaboration framework in a green hub network under soft time-windows: Dual lexicographic max–min approach
inferred← citeshttps://doi.org/10.1016/j.tre.2017.10.004openalex-snapshot
Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery
inferred← citeshttps://doi.org/10.1016/j.tre.2018.06.005openalex-snapshot
Design and analysis of a satellite network with direct delivery in the pharmaceutical industry
inferred← citeshttps://doi.org/10.1016/j.tre.2020.102188openalex-snapshot
Multimodal hub network design with flexible routes
inferred← citeshttps://doi.org/10.1016/j.tre.2020.102201openalex-snapshot
Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon
inferred← citeshttps://doi.org/10.1016/j.tre.2020.102202openalex-snapshot
Cold chain management in hierarchical operational hub networks
inferred← citeshttps://doi.org/10.1016/j.tre.2022.102903openalex-snapshot
Facility Location in Logistics and Transportation: An enduring relationship
inferred← citeshttps://doi.org/10.1016/s0966-8349(97)83422-5openalex-snapshot
The hub location and routing problem
inferred← citeshttps://doi.org/10.1051/ro/2017090openalex-snapshot
A generalized model and a heuristic algorithm for the large-scale covering tour problem
inferred← citeshttps://doi.org/10.1051/ro/2020125openalex-snapshot
Hub location problem in round-trip service applications
inferred← citeshttps://doi.org/10.1080/00207543.2015.1040127openalex-snapshot
The two-echelon multi-products location-routing problem with pickup and delivery: formulation and heuristic approaches
inferred← citeshttps://doi.org/10.1080/00207543.2017.1401235openalex-snapshot
A heterogeneous fleet two-echelon capacitated location-routing model for joint delivery arising in city logistics
inferred← citeshttps://doi.org/10.1080/00207543.2019.1693652openalex-snapshot
A variable neighbourhood decomposition search approach applied to a global liner shipping network using a hub-and-spoke with sub-hub structure
inferred← citeshttps://doi.org/10.1080/01605682.2023.2197933openalex-snapshot
Branch-and-price-and-cut algorithm for the capacitated single allocation hub location routeing problem
inferred← citeshttps://doi.org/10.1080/23249935.2026.2711924openalex-snapshot
Air cargo transportation by passenger flights considering cargo demand and capacity uncertainties
inferred← citeshttps://doi.org/10.1080/24725854.2018.1540900openalex-snapshot
Pre-positioning of relief items under road/facility vulnerability with concurrent restoration and relief transportation
inferred← citeshttps://doi.org/10.1109/access.2019.2938326openalex-snapshot
A Stochastic Linear Programming Method for the Reliable Oil Products Supply Chain System With Hub Disruption
inferred← citeshttps://doi.org/10.1109/chilecon47746.2019.8987467openalex-snapshot
Integer Programming Models for Wireless Networks with Star Backbone Topology
inferred← citeshttps://doi.org/10.1109/iesm.2015.7380214openalex-snapshot
Routing problem with pendular and cyclic service in a hierarchical structure of hub and spoke with multiple allocation of sub-hubs
inferred← citeshttps://doi.org/10.1109/iesm.2015.7380332openalex-snapshot
A model and a metaheuristic method for the Hub Location Routing Problem and application to postal services
inferred← citeshttps://doi.org/10.1109/ssci.2017.8285321openalex-snapshot
General contraction method for uncapacitated single allocation p-hub median problems
inferred← citeshttps://doi.org/10.1111/itor.12950openalex-snapshot
Location‐routing problem: a classification of recent research
inferred← citeshttps://doi.org/10.11606/t.3.2017.tde-24022017-080052openalex-snapshot
Modelagem do problema de localização/roteirização para o transporte de carga fracionada.
inferred← citeshttps://doi.org/10.1177/0037549717738336openalex-snapshot
Air parcel network design considering pure freighters
inferred← citeshttps://doi.org/10.1287/inte.2022.1131openalex-snapshot
The University of Michigan Implements a Hub-and-Spoke Design to Accommodate Social Distancing in the Campus Bus System Under COVID-19 Restrictions
inferred← citeshttps://doi.org/10.1287/trsc.2021.1070openalex-snapshot
Hub Location, Routing, and Route Dimensioning: Strategic and Tactical Intermodal Transportation Hub Network Design
inferred← citeshttps://doi.org/10.1287/trsc.2021.1094openalex-snapshot
Toward a Reference Experimental Benchmark for Solving Hub Location Problems
inferred← citeshttps://doi.org/10.17341/gazimmfd.1716850openalex-snapshot
İki aşamalı gürbüz tek atamalı p-Ana dağıtım üssü merkez ve açık uçlu rotalama problemi
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3887216/v1openalex-snapshot
A Multiobjective Evolutionary Approach to Solving Single-Allocation Hub Median Problem
inferred← citeshttps://doi.org/10.2139/ssrn.4899028openalex-snapshot
Hybrid Meta-Heuristic Algorithms for Solving Multi-Objective Hub Location Problem with Drone Based Delivery Mode
inferred← citeshttps://doi.org/10.22059/imj.2018.205732.1007047openalex-snapshot
Proposing a Multi-objective Model for Ground Transportation of Hazardous Materials in the Hub Network (Case Study: National Iranian Oil Products Distribution Company)
inferred← citeshttps://doi.org/10.2991/978-94-6239-148-2_66openalex-snapshot
Multiple Allocation Hub Location Problem with Flow-Dependent Set-up Cost
inferred← citeshttps://doi.org/10.2991/emcs-16.2016.455openalex-snapshot
A novel GRASP based on mixed k-opt method for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.3390/drones7010006openalex-snapshot
Optimizing the Hub-and-Spoke Network with Drone-Based Traveling Salesman Problem
inferred← citeshttps://doi.org/10.3390/math10122131openalex-snapshot
Regional Location Routing Problem for Waste Collection Using Hybrid Genetic Algorithm-Simulated Annealing
inferred← citeshttps://doi.org/10.3390/su13063571openalex-snapshot
Methodology for Determining the Location of River Ports on a Modernized Waterway Based on Non-Cost Criteria: A Case Study of the Odra River Waterway
inferred← citeshttps://doi.org/10.36334/modsim.2015.j4.kartalopenalex-snapshot
Integer Programming Formulations for the Uncapacitated Vehicle Routing p-Hub Center Problem
inferred← citeshttps://doi.org/10.4018/978-1-4666-8648-9.ch005openalex-snapshot
The Evolution of Logistics Hubs and a Conceptual Framework for Logistics Hubs Location Decisions
inferred← citeshttps://doi.org/10.4018/978-1-5225-5210-9.ch031openalex-snapshot
The Evolution of Logistics Hubs and a Conceptual Framework for Logistics Hubs Location Decisions
inferred← citeshttps://doi.org/10.46254/an12.20220096openalex-snapshot
A Mathematical Model of Local Drug Store Selection for Psychiatric Disorders in Thailand
inferred← citeshttps://doi.org/10.47749/t/unicamp.2014.932504openalex-snapshot
Um problema integrado de localização e roteamento com transporte entre concentradores e relação de muitos-para-muitos
inferred← citeshttps://doi.org/10.48550/arxiv.1705.07985openalex-snapshot
Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm
inferred← citeshttps://doi.org/10.5267/j.dsl.2020.2.002openalex-snapshot
Designing a hub covering location problem under uncertainty conditions
inferred← citeshttps://doi.org/10.5267/j.uscm.2017.5.003openalex-snapshot
A literature survey of HUB location problems and methods with emphasis on the marine transportations
inferred← citeshttps://doi.org/10.5505/jems.2016.81300openalex-snapshot
Dry Port Location Problem: A Hybrid Multi-Criteria Approach
inferred← citeshttps://doi.org/10.70675/1e4802a4z1bffz467cz8beaz737e569b4495openalex-snapshot
Optimization Models and Algorithms for the Design of Global Transportation Networks
inferred← citeshttps://doi.org/10.70675/457f1ef0z4499z4fb1z960ez2f398da0aba8openalex-snapshot
Logistic optimization in disaster response operations
inferred← citeshttps://doi.org/10.70675/cdb0051dz5a07z474ezb534z4aef357a004eopenalex-snapshot
Optimisation et simulation de la massification du transport multimodal de conteneurs
inferred← citeshttps://doi.org/10.70675/cf6377e6z1844z4359zb7d7zaf78bfcceb8eopenalex-snapshot
Green Hub Location-Routing Problem for LTL transport
inferred← citeshttps://doi.org/10.7717/peerj-cs.2840openalex-snapshot
The effect of different initial solutions on the metaheuristic algorithms for the single allocation p-hub center and routing problem
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.