On the public citation graph

Area Optimization for a T-Shaped Element by Using Pure Bending Equation and Particle Swarm Optimization

https://doi.org/10.2139/ssrn.4751823
0 signed · 10 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.1007/s11721-007-0002-0openalex-extracted
Particle swarm optimization
inferredcites →https://doi.org/10.1016/j.advengsoft.2013.12.007openalex-extracted
Grey Wolf Optimizer
inferredcites →https://doi.org/10.1016/j.cad.2010.12.015openalex-extracted
Teaching–learning-based optimization: A novel method for constrained mechanical design optimization problems
inferredcites →https://doi.org/10.1016/j.compstruct.2017.09.027openalex-extracted
Comprehensive local buckling equations for FRP I-sections in pure bending or compression
inferredcites →https://doi.org/10.1016/j.compstruct.2020.111925openalex-extracted
Experimental-numerical study on lateral-torsional buckling of PFRP beams under pure bending
inferredcites →https://doi.org/10.1016/j.tws.2007.10.013openalex-extracted
Open cross-section beams under pure bending. I. Experimental investigations
inferredcites →https://doi.org/10.1016/j.tws.2017.02.009openalex-extracted
Load-carrying capacity of thin-walled composite beams subjected to pure bending
inferredcites →https://doi.org/10.1109/icnn.1995.488968openalex-extracted
Particle swarm optimization
inferredcites →https://doi.org/10.1177/003754970107600201openalex-extracted
A New Heuristic Optimization Algorithm: Harmony Search
inferredcites →https://doi.org/10.5267/j.ijiec.2015.8.004openalex-extracted
Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems
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.