On the public citation graph

An Evolutionary Algorithm for Solving Bilevel Programming Problems Using Duality Conditions

0 signed · 32 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/978-1-4757-2836-1openalex-snapshot
Practical Bilevel Optimization: Algorithms and Applications
inferredcites →https://doi.org/10.1007/978-3-642-01216-7_69openalex-snapshot
A Neural Network Approach for Solving Linear Bilevel Programming Problem
inferredcites →https://doi.org/10.1007/s10288-005-0071-0openalex-snapshot
Bilevel programming: A survey
inferredcites →https://doi.org/10.1007/s10589-005-4612-4openalex-snapshot
A Trust-Region Method for Nonlinear Bilevel Programming: Algorithm and Computational Experience
inferredcites →https://doi.org/10.1007/s10898-009-9482-3openalex-snapshot
Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
inferredcites →https://doi.org/10.1007/s10898-011-9762-6openalex-snapshot
Bilevel problems over polyhedra with extreme point optimal solutions
inferredcites →https://doi.org/10.1007/s10957-008-9467-2openalex-snapshot
Solving Bilevel Linear Programs Using Multiple Objective Linear Programming
inferredcites →https://doi.org/10.1007/s10957-011-9819-1openalex-snapshot
Optimality and Duality Results for Bilevel Programming Problem Using Convexifactors
inferredcites →https://doi.org/10.1016/j.amc.2005.11.134openalex-snapshot
Linear bilevel programming with upper level constraints depending on the lower level solution
inferredcites →https://doi.org/10.1016/j.amc.2005.12.039openalex-snapshot
An extended branch and bound algorithm for linear bilevel programming
inferredcites →https://doi.org/10.1016/j.aml.2006.07.013openalex-snapshot
A hybrid neural network approach to bilevel programming problems
inferredcites →https://doi.org/10.1016/j.camwa.2009.02.028openalex-snapshot
Application of particle swarm optimization algorithm for solving bi-level linear programming problem
inferredcites →https://doi.org/10.1016/j.ejor.2007.03.034openalex-snapshot
A new approach for solving linear bilevel problems using genetic algorithms
inferredcites →https://doi.org/10.1016/s0252-9602(11)60265-8openalex-snapshot
A dual-relax penalty function approach for solving nonlinear bilevel programming with linear lower level problem
inferredcites →https://doi.org/10.1016/s0898-1221(98)00174-6openalex-snapshot
Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms
inferredcites →https://doi.org/10.1023/a:1023047900333openalex-snapshot
A Global Optimization Method for Solving Convex Quadratic Bilevel Programming Problems
inferredcites →https://doi.org/10.1057/jors.1991.23openalex-snapshot
Linear Bi-level Programming Problems — A Review
inferredcites →https://doi.org/10.1109/tsmcc.2004.841908openalex-snapshot
An Evolutionary Algorithm for Solving Nonlinear Bilevel Programming Based on a New Constraint-Handling Scheme
inferredcites →https://doi.org/10.1162/evco_a_00015openalex-snapshot
An Efficient and Accurate Solution Methodology for Bilevel Multi-Objective Programming Problems Using a Hybrid Evolutionary-Local-Search Algorithm
inferredcites →https://doi.org/10.1287/ijoc.1100.0430openalex-snapshot
A New Evolutionary Algorithm for a Class of Nonlinear Bilevel Programming Problems and Its Global Convergence

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-49428-5_7openalex-snapshot
Transmission Expansion Planning Outside the Box: A Bilevel Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-52119-6_20openalex-snapshot
Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-030-52119-6_5openalex-snapshot
Applications of Bilevel Optimization in Energy and Electricity Markets
inferred← citeshttps://doi.org/10.1007/s10957-025-02627-2openalex-snapshot
Duality-Based Single-Level Reformulations of Bilevel Optimization Problems
inferred← citeshttps://doi.org/10.1007/s11081-017-9369-yopenalex-snapshot
Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
inferred← citeshttps://doi.org/10.1016/j.cie.2019.106050openalex-snapshot
Synchronized scheduling of production and outbound shipping using bilevel-based simulated annealing algorithm
inferred← citeshttps://doi.org/10.1109/cec.2013.6557606openalex-snapshot
Differential evolution for bilevel programming
inferred← citeshttps://doi.org/10.1109/cis.2015.25openalex-snapshot
Improved Electromagnetism-Like Algorithm for Nonlinear Bilevel Programming Problem
inferred← citeshttps://doi.org/10.1109/icdis50059.2020.00022openalex-snapshot
Maximizing Resilience under Defender Attacker Model in Heterogeneous Multi-Networks
inferred← citeshttps://doi.org/10.1109/tpwrs.2022.3188432openalex-snapshot
Learning Active Constraints to Efficiently Solve Linear Bilevel Problems: Application to the Generator Strategic Bidding Problem
inferred← citeshttps://doi.org/10.1155/2013/378568openalex-snapshot
A Hybrid Estimation of Distribution Algorithm and Nelder-Mead Simplex Method for Solving a Class of Nonlinear Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1155/2014/430243openalex-snapshot
Solving the Bilevel Facility Location Problem under Preferences by a Stackelberg‐Evolutionary Algorithm
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.