On the public citation graph
Solution algorithm for an optimistic linear Stackelberg problem
0 signed · 44 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/zamm.19790590241openalex-snapshot
Beer, K., Lösung großer linearer Optimierungsaufgaben. Berlin. VEB Deutscher Verlag der Wissenschaften. 1977. 254 S., 15 Abb., M 40,‐
inferredcites →https://doi.org/10.1007/978-0-8176-4553-3_6openalex-snapshot
StackelbergWell-Posedness and Hierarchical Potential Games
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-0348-6328-5openalex-snapshot
Non-Linear Parametric Optimization
inferredcites →https://doi.org/10.1007/bf00941574openalex-snapshot
Some properties of the bilevel programming problem
inferredcites →https://doi.org/10.1007/bf01416737openalex-snapshot
On the numerical solution of a class of Stackelberg problems
inferredcites →https://doi.org/10.1007/bf01584986openalex-snapshot
A quadratically-convergent algorithm for general nonlinear programming problems
inferredcites →https://doi.org/10.1007/s10107-010-0342-1openalex-snapshot
Is bilevel programming a special case of a mathematical program with complementarity constraints?
inferredcites →https://doi.org/10.1016/j.amc.2006.10.045openalex-snapshot
A penalty function method based on Kuhn–Tucker condition for solving linear bilevel programming
inferredcites →https://doi.org/10.1016/j.na.2011.05.097openalex-snapshot
On the Karush–Kuhn–Tucker reformulation of the bilevel optimization problem
inferredcites →https://doi.org/10.1016/s0305-0548(01)00066-1openalex-snapshot
Linear bilevel programming solution by genetic algorithm
inferredcites →https://doi.org/10.1080/0233193031000149894openalex-snapshot
Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
inferredcites →https://doi.org/10.1080/02331930701617551openalex-snapshot
New necessary optimality conditions in optimistic bilevel programming
inferredcites →https://doi.org/10.1080/02331939508844060openalex-snapshot
Optimality conditions for bilevel programming problems
inferredcites →https://doi.org/10.1515/9783112706916openalex-snapshot
Non-Linear Parametric Optimization
inferredcites →https://doi.org/10.6028/jres.049.027openalex-snapshot
On approximate solutions of systems of linear inequalities
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-21803-4_69openalex-snapshot
Tropical Analogues of a Dempe-Franke Bilevel Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-22629-9_11openalex-snapshot
Computing Locally Optimal Solutions of the Bilevel Optimization Problem Using the KKT Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-52119-6_19openalex-snapshot
BOLIB: Bilevel Optimization LIBrary of Test Problems
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-981-10-4774-9_1openalex-snapshot
Bilevel Optimization: Reformulation and First Optimality Conditions
inferred← citeshttps://doi.org/10.1007/s10589-015-9795-8openalex-snapshot
On the solution of convex bilevel optimization problems
inferred← citeshttps://doi.org/10.1007/s10589-020-00250-7openalex-snapshot
Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization
inferred← citeshttps://doi.org/10.1007/s10957-017-1109-0openalex-snapshot
A Bridge Between Bilevel Programs and Nash Games
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.1007/s11228-016-0371-xopenalex-snapshot
Solving Ill-posed Bilevel Programs
inferred← citeshttps://doi.org/10.1007/s12597-024-00857-yopenalex-snapshot
On efficiency conditions for nonsmooth multiobjective fractional bilevel programming with non-locally Lipschitz functions
inferred← citeshttps://doi.org/10.1007/s40314-021-01617-0openalex-snapshot
A relaxation solving approach for the linear trilevel programming problem
inferred← citeshttps://doi.org/10.1016/j.cor.2015.12.007openalex-snapshot
Capacity expansion of stochastic power generation under two-stage electricity markets
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.02.057openalex-snapshot
Backward induction algorithm for a class of closed-loop Stackelberg games
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.08.051openalex-snapshot
Bilevel optimization with sustainability perspective: A survey on applications
inferred← citeshttps://doi.org/10.1016/j.orl.2022.12.005openalex-snapshot
A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming
inferred← citeshttps://doi.org/10.1080/02331934.2019.1581192openalex-snapshot
Solution of bilevel optimization problems using the KKT approach
inferred← citeshttps://doi.org/10.1080/10556788.2021.1977810openalex-snapshot
Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
inferred← citeshttps://doi.org/10.1137/20m1352375openalex-snapshot
A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization
inferred← citeshttps://doi.org/10.1186/1029-242x-2014-164openalex-snapshot
A solution method for the optimistic linear semivectorial bilevel optimization problem
inferred← citeshttps://doi.org/10.23952/jano.1.2019.3.04openalex-snapshot
Solving bilevel problems with polyhedral constraint set
inferred← citeshttps://doi.org/10.37193/cjm.2019.03.08openalex-snapshot
A nonsmooth Stackelberg equilibrium problem via mixed variational inequalities
inferred← citeshttps://doi.org/10.48550/arxiv.1510.06695openalex-snapshot
A Bridge between Bilevel Programs and Nash Games
inferred← citeshttps://doi.org/10.70675/a782657ez5e48z4e07z8804z1a2e129f2ee9openalex-snapshot
A tropical geometry and discrete convexity approach to bilevel programming : application to smart data pricing in mobile telecommunication networks
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.