On the public citation graph
https://doi.org/10.2139/ssrn.4662597
0 signed · 42 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/978-3-319-52654-6_7openalex-extracted
Huff-Like Stackelberg Location Problems on the Plane
inferredcites →https://doi.org/10.1007/978-3-319-95165-2_41openalex-extracted
The Huff Versus the Pareto-Huff Customer Choice Rules in a Discrete Competitive Location Model
inferredcites →https://doi.org/10.1007/s10472-014-9448-0openalex-extracted
Models and algorithms for competitive facility location problems with different customer behavior
inferredcites →https://doi.org/10.1007/s10479-014-1676-5openalex-extracted
Profit maximization and reduction of the cannibalization effect in chain expansion
inferredcites →https://doi.org/10.1007/s10479-014-1699-yopenalex-extracted
Sequential location of two facilities: comparing random to optimal location of the first facility
inferredcites →https://doi.org/10.1007/s10479-015-1793-9openalex-extracted
On competition in a Stackelberg location-design model with deterministic supplier choice
inferredcites →https://doi.org/10.1007/s10479-017-2579-zopenalex-extracted
Optimization of competitive facility location for chain stores
inferredcites →https://doi.org/10.1007/s10732-015-9282-5openalex-extracted
A hybrid genetic algorithm with solution archive for the discrete $$(r|p)$$ ( r | p ) -centroid problem
inferredcites →https://doi.org/10.1007/s11227-014-1106-0openalex-extracted
Solving a leader–follower facility problem via parallel evolutionary approaches
inferredcites →https://doi.org/10.1007/s11590-012-0596-zopenalex-extracted
An approach for solving competitive location problems with variable demand using multicore systems
inferredcites →https://doi.org/10.1007/s12159-014-0114-zopenalex-extracted
A review of competitive facility location in the plane
inferredcites →https://doi.org/10.1016/j.amc.2014.08.036openalex-extracted
Parallelization of a non-linear multi-objective optimization algorithm: Application to a location problem
inferredcites →https://doi.org/10.1016/j.asoc.2018.11.029openalex-extracted
Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking
inferredcites →https://doi.org/10.1016/j.cie.2016.10.015openalex-extracted
A hybrid genetic algorithm with variable neighborhood search for dynamic integrated process planning and scheduling
inferredcites →https://doi.org/10.1016/j.cie.2017.04.024openalex-extracted
Competitive facility location problem with foresight considering service distance limitations
inferredcites →https://doi.org/10.1016/j.cie.2017.06.009openalex-extracted
A bibliometric analysis of Genetic Algorithms throughout the history
inferredcites →https://doi.org/10.1016/j.cie.2018.07.045openalex-extracted
A modified genetic algorithm for the capacitated competitive facility location problem with the partial demand satisfaction
inferredcites →https://doi.org/10.1016/j.cie.2023.109206openalex-extracted
A robust possibilistic multi-echelon multi-product multi-period production-inventory-routing problem considering internal operations of cross-docks: Case study of FMCG supply chain
inferredcites →https://doi.org/10.1016/j.cor.2013.05.003openalex-extracted
A local search heuristic for the (r|p)-centroid problem in the plane
inferredcites →https://doi.org/10.1016/j.cor.2014.02.013openalex-extracted
Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem
inferredcites →https://doi.org/10.1016/j.cor.2015.04.012openalex-extracted
A leader–follower model for discrete competitive facility location
inferredcites →https://doi.org/10.1016/j.cor.2016.03.005openalex-extracted
Solving multifacility Huff location models on networks using metaheuristic and exact approaches
inferredcites →https://doi.org/10.1016/j.cor.2016.10.002openalex-extracted
New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
inferredcites →https://doi.org/10.1016/j.cor.2018.02.013openalex-extracted
Exact method for the capacitated competitive facility location problem
inferredcites →https://doi.org/10.1016/j.cor.2018.08.001openalex-extracted
The probabilistic customer’s choice rule with a threshold attraction value: Effect on the location of competitive facilities in the plane
inferredcites →https://doi.org/10.1016/j.cor.2018.12.010openalex-extracted
Approximation of the competitive facility location problem with MIPs
inferredcites →https://doi.org/10.1016/j.cor.2020.105048openalex-extracted
A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand
inferredcites →https://doi.org/10.1016/j.engappai.2020.104121openalex-extracted
A hybrid of clustering and meta-heuristic algorithms to solve a p-mobile hub location–allocation problem with the depreciation cost of hub facilities
inferredcites →https://doi.org/10.1016/j.jclepro.2020.124343openalex-extracted
A green multi-facilities open location-routing problem with planar facility locations and uncertain customer
inferredcites →https://doi.org/10.1016/j.jjimei.2022.100132openalex-extracted
Multi-echelon and multi-period supply chain management network design considering different importance for customers management using a novel meta-heuristic algorithm
inferredcites →https://doi.org/10.1016/j.orl.2018.02.008openalex-extracted
Competitive facility location with random attractiveness
inferredcites →https://doi.org/10.1016/j.tre.2022.102821openalex-extracted
A multi-objective optimization model for the problems of sustainable collaborative hub location and cost sharing
inferredcites →https://doi.org/10.1016/s0305-0548(97)00031-2openalex-extracted
Variable neighborhood search
inferredcites →https://doi.org/10.1016/s0377-2217(00)00169-7openalex-extracted
Static competitive facility location: An overview of optimisation approaches
inferredcites →https://doi.org/10.1080/10556788.2014.973875openalex-extracted
Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems
inferredcites →https://doi.org/10.1109/tsmc.2018.2881686openalex-extracted
An Effective Hybrid Genetic Algorithm and Variable Neighborhood Search for Integrated Process Planning and Scheduling in a Packaging Machine Workshop
inferredcites →https://doi.org/10.1134/s0005117914040080openalex-extracted
Fast metaheuristics for the discrete (r|p)-centroid problem
inferredcites →https://doi.org/10.1134/s0005117914040109openalex-extracted
Randomized local search for the discrete competitive facility location problem
inferredcites →https://doi.org/10.1134/s0005117914040110openalex-extracted
Bilevel competitive facility location and pricing problems
inferredcites →https://doi.org/10.1287/opre.43.2.264openalex-extracted
Robust Optimization of Large-Scale Systems
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.