OpenMETU
metadata only
Solution approaches for the leader-follower orienteering problem
This thesis studies the leader-follower orienteering problem (LFOP) on a completely connected undirected graph as a bilevel Stackelberg game between two selfish agents, a leader and a follower. Both start from the same depot and maximize their own prizes within a common time budget. The leader selec
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
- REFRAMING DECISION PROBLEMS: A GRAPH-GRAMMAR APPROACH#933485
- Maker-Breaker Largest Connected Subgraph Game in Trees#1090704
- Rapport technique du projet Stratégies fourragères#354138
- Preference-based opponent shaping in differentiable games#1104830
- Matroid Packing Games: The Core and the Nucleolus#1141321
Record · ID 989194
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