On the public citation graph
On a stochastic bilevel programming problem
0 signed · 53 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/net.20164openalex-snapshot
Joint optimization of pricing and resource allocation in competitive telecommunications networks
inferredcites →https://doi.org/10.1002/net.20368openalex-snapshot
A polyhedral study of the network pricing problem with connected toll arcs
inferredcites →https://doi.org/10.1007/978-0-387-30165-5_27openalex-snapshot
Stochastic Optimization in Telecommunications
inferredcites →https://doi.org/10.1007/978-1-4615-2025-2openalex-snapshot
Handbook of Global Optimization
inferredcites →https://doi.org/10.1007/bf00121267openalex-snapshot
Test problem construction for linear bilevel programming problems
inferredcites →https://doi.org/10.1007/bf00939048openalex-snapshot
Pricing problems with a continuum of customers as stochastic Stackelberg games
inferredcites →https://doi.org/10.1007/bf01130087openalex-snapshot
Finite algorithm to find the saddle point of a quadratic function subject to linear constraints
inferredcites →https://doi.org/10.1007/bf01448847openalex-snapshot
Zur Theorie der Gesellschaftsspiele
inferredcites →https://doi.org/10.1007/bf01580367openalex-snapshot
A cutting plane algorithm for solving bilinear programs
inferredcites →https://doi.org/10.1007/bf01581626openalex-snapshot
A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
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/bf02275351openalex-snapshot
Discrete linear bilevel programming problem
inferredcites →https://doi.org/10.1007/s001580100115openalex-snapshot
Stochastic bilevel programming in structural optimization
inferredcites →https://doi.org/10.1007/s10479-006-6159-xopenalex-snapshot
Extending the stochastic programming framework for the modeling of several decision makers: pricing and competition in the telecommunication sector
inferredcites →https://doi.org/10.1007/s10479-007-0176-2openalex-snapshot
An overview of bilevel optimization
inferredcites →https://doi.org/10.1007/s10479-009-0577-5openalex-snapshot
Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm
inferredcites →https://doi.org/10.1007/s10898-010-9566-0openalex-snapshot
Knapsack problem with probability constraints
inferredcites →https://doi.org/10.1016/0898-1221(90)90148-dopenalex-snapshot
Jointly constrained bilinear programs and related problems: An overview
inferredcites →https://doi.org/10.1016/j.orl.2010.04.005openalex-snapshot
The bilevel knapsack problem with stochastic right-hand sides
inferredcites →https://doi.org/10.1016/s0167-6377(99)00052-8openalex-snapshot
Stochastic mathematical programs with equilibrium constraints
inferredcites →https://doi.org/10.1016/s1388-3437(01)80112-8openalex-snapshot
Combined economic modeling and traffic engineering: Joint optimization of pricing and routing in multi-service networks
inferredcites →https://doi.org/10.1023/a:1022645805569openalex-snapshot
Links Between Linear Bilevel and Mixed 0–1 Programming Problems
inferredcites →https://doi.org/10.1057/jors.1981.156openalex-snapshot
A Representation and Economic Interpretation of a Two-Level Programming Problem
inferredcites →https://doi.org/10.1057/palgrave.rpm.5170046openalex-snapshot
A bilevel modelling approach to pricing and fare optimisation in the airline industry
inferredcites →https://doi.org/10.1287/mnsc.44.12.1595openalex-snapshot
Modeling and Worker Motivation in JIT Production Systems
inferredcites →https://doi.org/10.1287/mnsc.44.12.1608openalex-snapshot
A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
inferredcites →https://doi.org/10.1287/moor.8.2.273openalex-snapshot
Jointly Constrained Biconvex Programming
inferredcites →https://doi.org/10.3138/infor.46.4.231openalex-snapshot
Bilevel Programming: The Montreal School
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-1-4899-7547-8_3openalex-snapshot
Simulation-Based Modelling of a Stochastic Equilibrium
inferred← citeshttps://doi.org/10.1007/978-3-030-52119-6_17openalex-snapshot
Bilevel Linear Optimization Under Uncertainty
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/s00500-017-2811-4openalex-snapshot
An approach based on reliability-based possibility degree of interval for solving general interval bilevel linear programming problem
inferred← citeshttps://doi.org/10.1007/s11590-017-1130-0openalex-snapshot
Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control
inferred← citeshttps://doi.org/10.1007/s13042-012-0126-4openalex-snapshot
Random fuzzy bilevel linear programming through possibility-based value at risk model
inferred← citeshttps://doi.org/10.1016/j.cor.2020.104942openalex-snapshot
A systematic sampling evolutionary (SSE) method for stochastic bilevel programming problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.01.008openalex-snapshot
A survey on bilevel optimization under uncertainty
inferred← citeshttps://doi.org/10.1016/j.knosys.2014.05.010openalex-snapshot
Optimistic Stackelberg solutions to bilevel linear programming with fuzzy random variable coefficients
inferred← citeshttps://doi.org/10.1016/j.tre.2025.104643openalex-snapshot
Robust design and pricing of electric vehicle battery reuse network by tailored branch-and-cut algorithm
inferred← citeshttps://doi.org/10.1137/19m1242240openalex-snapshot
Risk-Averse Models in Bilevel Stochastic Linear Programming
inferred← citeshttps://doi.org/10.1186/s13660-017-1384-1openalex-snapshot
A novel approach based on preference-based index for interval bilevel linear programming problem
inferred← citeshttps://doi.org/10.1287/ijoc.2020.1055openalex-snapshot
Bilevel Integer Programs with Stochastic Right-Hand Sides
inferred← citeshttps://doi.org/10.17535/crorr.2019.0025openalex-snapshot
Bi-level optimization based on fuzzy if-then rule
inferred← citeshttps://doi.org/10.2139/ssrn.7275436openalex-snapshot
Risk-Informed Planning of Protective Investments in Public Buildings under Adversarial Uncertainty: A Stochastic Bilevel Optimisation Framework
inferred← citeshttps://doi.org/10.3233/jifs-152354openalex-snapshot
Solving bi-level programming problem with fuzzy random variable coefficients
inferred← citeshttps://doi.org/10.4018/978-1-7998-7596-3.ch006openalex-snapshot
Bi-Level Programming for Earning Management in Imprecise and Random Environments
inferred← citeshttps://doi.org/10.4018/ijfsa.2021010103openalex-snapshot
On Solving Linguistic Bi-Level Programming Problem Using Dynamic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04663openalex-snapshot
Bilevel Optimization under Uncertainty
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.