On the public citation graph
On an algorithm solving two-level programming problems with nonunique lower level solutions
0 signed · 79 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-0348-6328-5openalex-snapshot
Non-Linear Parametric Optimization
inferredcites →https://doi.org/10.1007/978-3-663-12160-2openalex-snapshot
Parametric Optimization: Singularities, Pathfollowing and Jumps
inferredcites →https://doi.org/10.1007/bf01096458openalex-snapshot
Bilevel and multilevel programming: A bibliography review
inferredcites →https://doi.org/10.1007/bf01580580openalex-snapshot
Network design problem with congestion effects: A case of bilevel programming
inferredcites →https://doi.org/10.1007/bf01581237openalex-snapshot
Directional differentiability of optimal solutions under Slater's condition
inferredcites →https://doi.org/10.1007/bf01593777openalex-snapshot
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
inferredcites →https://doi.org/10.1007/bf02098173openalex-snapshot
Double penalty method for bilevel optimization problems
inferredcites →https://doi.org/10.1007/bfb0083589openalex-snapshot
ε-Regularized two-level optimization problems: Approximation and existence results
inferredcites →https://doi.org/10.1007/bfb0120963openalex-snapshot
On some recent engineering applications of complementarity problems
inferredcites →https://doi.org/10.1007/bfb0121154openalex-snapshot
Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
inferredcites →https://doi.org/10.1007/bfb0121215openalex-snapshot
Solution point differentiability without strict complementarity in nonlinear programming
inferredcites →https://doi.org/10.1016/0016-7037(83)90196-5openalex-snapshot
Chemical reaction equilibrium analysis: Theory and algorithms
inferredcites →https://doi.org/10.1016/0167-6377(88)90066-1openalex-snapshot
Existence of optimal solutions to mathematical programs with equilibrium constraints
inferredcites →https://doi.org/10.1016/0377-2217(85)90133-xopenalex-snapshot
Geometric and algorithmic developments for a hierarchical planning problem
inferredcites →https://doi.org/10.1016/0377-2217(93)90153-eopenalex-snapshot
Parametric optimization: Singularities, pathfollowing, and jumps
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6041-2openalex-snapshot
Introduction to Sensitivity and Stability Analysis in Nonlinear Programming
inferredcites →https://doi.org/10.1080/02331938708843300openalex-snapshot
Existence theorems of equilibrium points in stackelberg
inferredcites →https://doi.org/10.1080/02331939208843831openalex-snapshot
A necessary and a sufficient optimality condition for bilevel programming problems
inferredcites →https://doi.org/10.1137/0326037openalex-snapshot
Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
inferredcites →https://doi.org/10.1137/0801006openalex-snapshot
Minimization of Locally Lipschitzian Functions
inferredcites →https://doi.org/10.1287/opre.21.1.188openalex-snapshot
Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_36openalex-snapshot
Bilevel Programming: Implicit Function Approach
inferred← citeshttps://doi.org/10.1007/0-387-34221-4_1openalex-snapshot
Optimality conditions for bilevel programming problems
inferred← citeshttps://doi.org/10.1007/0-8176-4501-2_12openalex-snapshot
Stackelberg Problems: Subgame Perfect Equilibria via Tikhonov Regularization
inferred← citeshttps://doi.org/10.1007/3-540-34783-6_41openalex-snapshot
Optimal Toll Charges in a Fuzzy Flow Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_44openalex-snapshot
Bilevel Programming: Implicit Function Approach
inferred← citeshttps://doi.org/10.1007/978-0-8176-4553-3_6openalex-snapshot
StackelbergWell-Posedness and Hierarchical Potential Games
inferred← citeshttps://doi.org/10.1007/978-1-4613-0307-7_12openalex-snapshot
An Implicit Function Approach to Bilevel Programming 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-3-030-52119-6_4openalex-snapshot
Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_44-1openalex-snapshot
Bilevel Programming: Implicit Function Approach
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/bf00121269openalex-snapshot
Weak via strong Stackelberg problem: New results
inferred← citeshttps://doi.org/10.1007/s10479-011-1023-zopenalex-snapshot
Bilevel road pricing: theoretical analysis and optimality conditions
inferred← citeshttps://doi.org/10.1007/s10589-020-00254-3openalex-snapshot
Gauss–Newton-type methods for bilevel optimization
inferred← citeshttps://doi.org/10.1007/s10614-023-10471-7openalex-snapshot
Computing Synthetic Controls Using Bilevel Optimization
inferred← citeshttps://doi.org/10.1007/s10898-007-9154-0openalex-snapshot
Necessary optimality conditions for bilevel set optimization problems
inferred← citeshttps://doi.org/10.1007/s11228-016-0371-xopenalex-snapshot
Solving Ill-posed Bilevel Programs
inferred← citeshttps://doi.org/10.1007/s11228-021-00605-0openalex-snapshot
Softening Bilevel Problems Via Two-scale Gibbs Measures
inferred← citeshttps://doi.org/10.1016/j.cor.2017.12.014openalex-snapshot
A semivectorial bilevel programming approach to optimize electricity dynamic time-of-use retail pricing
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.09.001openalex-snapshot
One-level reformulation of the bilevel Knapsack problem using dynamic programming
inferred← citeshttps://doi.org/10.1017/9781108277402openalex-snapshot
Game Theory for Next Generation Wireless and Communication Networks
inferred← citeshttps://doi.org/10.1017/9781108277402.005openalex-snapshot
Games with Bounded Rationality
inferred← citeshttps://doi.org/10.1017/9781108277402.007openalex-snapshot
Equilibrium Programming with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1017/9781108277402.009openalex-snapshot
Applications of Game Theory in the Internet of Things
inferred← citeshttps://doi.org/10.1017/9781108277402.010openalex-snapshot
Applications of Game Theory in Network Virtualization
inferred← citeshttps://doi.org/10.1017/9781108277402.011openalex-snapshot
Applications of Game Theory in Cloud Networking
inferred← citeshttps://doi.org/10.1017/9781108277402.012openalex-snapshot
Applications of Game Theory in Context-Aware Networks and Mobile Services
inferred← citeshttps://doi.org/10.1017/9781108277402.013openalex-snapshot
Applications of Game Theory for Green Communication Networks
inferred← citeshttps://doi.org/10.1023/a:1008735010803openalex-snapshot
A Bundle Algorithm Applied to Bilevel Programming Problems with Non-Unique Lower Level Solutions
inferred← citeshttps://doi.org/10.1023/a:1017571111854openalex-snapshot
Bundle Trust-Region Algorithm for Bilinear Bilevel Programming
inferred← citeshttps://doi.org/10.1023/a:1022646611097openalex-snapshot
First-Order Necessary Optimality Conditions for General Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1023/a:1023669004408openalex-snapshot
Multivalued Analysis and Differential Properties of Multivalued Mappings
inferred← citeshttps://doi.org/10.1080/0233193031000149894openalex-snapshot
Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1080/02331930600816189openalex-snapshot
Optimality conditions for bilevel programming problems
inferred← citeshttps://doi.org/10.1080/02331934.2011.641546openalex-snapshot
Feasible direction method for bilevel programming problem
inferred← citeshttps://doi.org/10.1080/02331934.2024.2422020openalex-snapshot
Lower Stackelberg equilibria: from bilevel optimization to Stackelberg games
inferred← citeshttps://doi.org/10.1080/02331934.2025.2487713openalex-snapshot
One way to solve pessimistic bilevel optimization problems
inferred← citeshttps://doi.org/10.1080/02331934.2025.2548732openalex-snapshot
Special issue to celebrate the scientific career of Stephan Dempe
inferred← citeshttps://doi.org/10.1080/02331939508844061openalex-snapshot
Computing optimal incentives via bilevel programming
inferred← citeshttps://doi.org/10.1109/twc.2018.2847658openalex-snapshot
Stackelberg Game for Distributed Time Scheduling in RF-Powered Backscatter Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/wicom.2008.1520openalex-snapshot
The Analysis of the Supply Chain Incentive Contract under Asymmetric Information
inferred← citeshttps://doi.org/10.1142/s021919892440005xopenalex-snapshot
On Construction of Subgame Perfect Nash Equilibria in Stackelberg Games
inferred← citeshttps://doi.org/10.1190/geo2017-0826.1openalex-snapshot
Toward a stable iterative migration velocity analysis scheme
inferred← citeshttps://doi.org/10.1287/trsc.36.3.271.7826openalex-snapshot
A Mathematical Model and Descent Algorithm for Bilevel Traffic Management
inferred← citeshttps://doi.org/10.32657/10356/12165openalex-snapshot
Integrated planning and scheduling for precast concrete production
inferred← citeshttps://doi.org/10.3390/math11061422openalex-snapshot
The New Solution Concept to Ill-Posed Bilevel Programming: Non-Antagonistic Pessimistic Solution
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.