arXiv (All)
open access
Parametric maximum closure on precedence forests
The Maximum Closure Problem asks for a maximum-weight closed subset of a precedence-constrained set of vertices; when vertex weights depend affinely on a scalar parameter $λ$, as in open-pit mine scheduling, the goal becomes computing the optimal closed set for every value of $λ$ at once. We address
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
- Forbidden Subgraphs of Graphs with Low Bandwidth#822364
- Weighted cost emission dispatch optimization using GA-APO hybridization under priority sensitive scheduling for thermal power systems.#13393
- Powers' Conjecture on the Third Largest Eigenvalue of a Graph#1135814
- Scheduling to Maximize Weighted Throughput with an Active-Time Budget#794208
- Scheduling to Maximize Weighted Throughput with an Active-Time Budget#790189
Record · ID 1061737
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