On the public citation graph

A Commutative Bi-Level Multi-Objective Green Location–Routing Problem: A Novel Mathematical Model and Efficient Solution Method

https://doi.org/10.2139/ssrn.6205843
0 signed · 16 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/1520-6750(199204)39:3<419::aid-nav3220390310>3.0.co;2-copenalex-snapshot
An algorithm for the discrete bilevel programming problem
inferredcites →https://doi.org/10.1007/978-3-030-74051-1openalex-snapshot
Handbook of Operations Research and Management Science in Higher Education
inferredcites →https://doi.org/10.1007/bf02579017openalex-snapshot
Tabu Search heuristics for the Vehicle Routing Problem with Time Windows
inferredcites →https://doi.org/10.1007/s00170-007-1056-2openalex-snapshot
TASTE: a two-phase heuristic to solve a routing problem with simultaneous delivery and pick-up
inferredcites →https://doi.org/10.1007/s10479-021-04195-wopenalex-snapshot
A tabu search algorithm to solve a green logistics bi-objective bi-level problem
inferredcites →https://doi.org/10.1007/s12293-012-0075-1openalex-snapshot
Chemical Reaction Optimization: a tutorial
inferredcites →https://doi.org/10.1016/j.cor.2005.09.012openalex-snapshot
A general heuristic for vehicle routing problems
inferredcites →https://doi.org/10.1016/j.cor.2014.10.019openalex-snapshot
Hybrid metaheuristics for the Clustered Vehicle Routing Problem
inferredcites →https://doi.org/10.1016/j.ejor.2021.09.036openalex-snapshot
Planning sustainable routes: Economic, environmental and welfare concerns
inferredcites →https://doi.org/10.1016/j.sbspro.2015.03.189openalex-snapshot
Multi-objective Optimization Model for a Green Vehicle Routing Problem
inferredcites →https://doi.org/10.1080/0305215x.2021.1895991openalex-snapshot
An efficient chemical reaction algorithm for multi-objective combinatorial bi-level optimization
inferredcites →https://doi.org/10.1109/4235.996017openalex-snapshot
A fast and elitist multiobjective genetic algorithm: NSGA-II
inferredcites →https://doi.org/10.1134/s1990478909040012openalex-snapshot
Upper bounds for objective functions of discrete competitive facility location problems
inferredcites →https://doi.org/10.1287/mnsc.6.1.80openalex-snapshot
The Truck Dispatching Problem
inferredcites →https://doi.org/10.1287/trsc.2016.0734openalex-snapshot
An Exact Algorithm for the Green Vehicle Routing Problem
inferredcites →https://doi.org/10.1504/ijaom.2014.059623openalex-snapshot
A green routing problem: optimising CO2 emissions and costs from a bi-fuel vehicle fleet
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.