arXiv (All)
open access
LLMs Can Design Near-Optimal OR Algorithms
We ask whether large language models (LLMs) can design effective algorithms for well-specified operations research (OR) problems. We study inventory control, queueing network control, and assortment optimization. We evaluate two levels of LLM use: at level 1, the model receives one problem instance
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
- Trivalent Semantics for Conditional Obligations#80874
- DKL: Decoupled Knowledge Learning for Instruction-Tuned Language Models#632873
- OR for AI That Does OR: Routing LLMs up the Escalator inside the OSCAR Framework#1155847
- ENHANCING CONTINGENCY CONTRACTING WITH OPERATIONALIZED LARGE LANGUAGE MODELS#919727
- Rules in programming languages and networks#95485
Record · ID 986342
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