On the public citation graph
Test problem construction for linear bilevel programming problems
0 signed · 47 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/nav.3800310104openalex-snapshot
Optimality conditions for the bilevel programming problem
inferredcites →https://doi.org/10.1007/3-540-53032-0openalex-snapshot
A Collection of Test Problems for Constrained Global Optimization Algorithms
inferredcites →https://doi.org/10.1007/bf00121661openalex-snapshot
Computational experience using an edge search algorithm for linear reverse convex programs
inferredcites →https://doi.org/10.1007/bf00940342openalex-snapshot
On the structure and properties of a linear multilevel programming problem
inferredcites →https://doi.org/10.1007/bf01096458openalex-snapshot
Bilevel and multilevel programming: A bibliography review
inferredcites →https://doi.org/10.1007/bf01097001openalex-snapshot
A generalization of the construction of test problems for nonconvex optimization
inferredcites →https://doi.org/10.1007/bf01098360openalex-snapshot
A quasiconcave minimization method for solving linear two-level programs
inferredcites →https://doi.org/10.1007/bf01100237openalex-snapshot
A global optimization approach for the linear two-level program
inferredcites →https://doi.org/10.1007/bf01442898openalex-snapshot
Linear programs with an additional reverse convex constraint
inferredcites →https://doi.org/10.1007/bf01593787openalex-snapshot
Bilinear programming: An exact algorithm
inferredcites →https://doi.org/10.1007/bf02098176openalex-snapshot
Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
inferredcites →https://doi.org/10.1007/bf02191668openalex-snapshot
Construction of test problems for a class of reverse convex programs
inferredcites →https://doi.org/10.1007/bf02239754openalex-snapshot
Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
inferredcites →https://doi.org/10.1007/bf02239972openalex-snapshot
Global minimization of indefinite quadratic problems
inferredcites →https://doi.org/10.1109/21.101139openalex-snapshot
Algorithms for nonlinear bilevel mathematical programs
inferredcites →https://doi.org/10.1137/0914049openalex-snapshot
Generating Linear and Linear-Quadratic Bilevel Programming Problems
inferredcites →https://doi.org/10.1145/103147.103156openalex-snapshot
Construction of test problems in quadratic bivalent programming
inferredcites →https://doi.org/10.1145/174603.174411openalex-snapshot
Generating quadratic bilevel programming test problems
inferredcites →https://doi.org/10.1145/328512.328516openalex-snapshot
Generation of large-scale quadratic programs for use as global optimization test problems
inferredcites →https://doi.org/10.1287/moor.8.2.260openalex-snapshot
An Algorithm for Solving the General Bilevel Programming Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20482openalex-snapshot
On a stochastic bilevel programming problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-0307-7_11openalex-snapshot
A Penalty Method for Linear 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-642-21527-8_69openalex-snapshot
Computing Upper Bounds for a LBPP with and without Probabilistic Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-32650-9_35openalex-snapshot
Using MOPSO to Solve Multiobjective Bilevel Linear Problems
inferred← citeshttps://doi.org/10.1007/s12293-022-00379-4openalex-snapshot
A hybrid heuristic approach with adaptive scalarization for linear semivectorial bilevel programming and its application
inferred← citeshttps://doi.org/10.1007/s12293-026-00506-5openalex-snapshot
A Scalable Benchmark Framework for Bilevel Optimization without Variable Separability
inferred← citeshttps://doi.org/10.1007/s12532-025-00294-yopenalex-snapshot
BOBILib: Bilevel Optimization (Benchmark) Instance Library
inferred← citeshttps://doi.org/10.1016/j.amc.2014.09.013openalex-snapshot
An algorithm based on particle swarm optimization for multiobjective bilevel linear problems
inferred← citeshttps://doi.org/10.1016/j.cor.2016.08.001openalex-snapshot
Approximated set-valued mapping approach for handling multiobjective bilevel problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00336-1openalex-snapshot
Determining optimal pollution control policies: An application of bilevel programming
inferred← citeshttps://doi.org/10.1023/a:1008225728209openalex-snapshot
Test Functions with Variable Attraction Regions for Global Optimization Problems
inferred← citeshttps://doi.org/10.1023/a:1013398219772openalex-snapshot
Strategic Management Decision Support System: An Analysis of the Environmental Policy Issues
inferred← citeshttps://doi.org/10.1023/a:1022636914306openalex-snapshot
Construction of Test Problems for Concave Minimization Under Linear and Nonlinear Constraints
inferred← citeshttps://doi.org/10.1080/0233193031000149894openalex-snapshot
Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1109/cec.2012.6256557openalex-snapshot
Unconstrained scalable test problems for single-objective bilevel optimization
inferred← citeshttps://doi.org/10.1109/cis.2013.19openalex-snapshot
A Differential Evolution with Two Mutation Strategies for Linear Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1109/cis.2015.18openalex-snapshot
Solving Linear Bilevel Programming Problems Using a Binary Differential Evolution
inferred← citeshttps://doi.org/10.1109/jsee.2014.00051openalex-snapshot
Solution for integer linear bilevel programming problems using orthogonal genetic algorithm
inferred← citeshttps://doi.org/10.1134/s1995423914030033openalex-snapshot
Test problem generation for quadratic-linear pessimistic bilevel optimization
inferred← citeshttps://doi.org/10.1155/2014/820747openalex-snapshot
A Differential Evolution with Two Mutation Strategies and a Selection Based on an Improved Constraint‐Handling Technique for Bilevel Programming Problems
inferred← citeshttps://doi.org/10.1162/evco_a_00116openalex-snapshot
Test Problem Construction for Single-Objective Bilevel Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1103.2695openalex-snapshot
Software for Generation of Classes of Test Functions with Known Local and Global Minima for Global Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1401.1942openalex-snapshot
Test Problem Construction for Single-Objective Bilevel Optimization
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.