arXiv (All)
open access
Are Single-Leader-Multi-Follower Problems Particular Cases of Bilevel Optimization?
For more than 20 years, single-leader multi-follower (SLMF) problems have been treated as a more difficult class of problems in comparison to bilevel optimization. In this work we challenge this common belief, studying whether SLMF problems can be reformulated as equivalent bilevel optimization prob
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Coupling Constraints in Pessimistic Linear Bilevel Optimization#388224
- A true single-level reformulation for pessimistic bilevel optimization#1142315
- A Review of Bilevel Optimization: Methods, Emerging Applications, and Recent Advancements#1117272
- S$^3$LDBO: A Snapshot Single-Loop Algorithm for Decentralized Bilevel Optimization#246538
- Disciplined Bilevel Programming#820067
Record · ID 1387732
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive