arXiv (All)
open access
Pareto sensitivity, most-changing sub-fronts, and knee solutions
When dealing with a multi-objective optimization problem, identifying Pareto optimal solutions that capture relevant trade-offs may not be straightforward. Popular choices include the so-called Pareto knee solutions, which correspond to nondominated points on the Pareto front where a small improveme
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
- Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs#987592
- Submodular Maximization over Bipartite Perfect Matchings and Matroid Intersection Bases#1036087
- Optimality modeling in a suboptimal world#761475
- Breaking the 1/3 Barrier for $\boldsymbol{k}$-Submodular Maximization under Matroid and Knapsack Constraints: A Proportional Top-2 Randomized Framework#1109655
- Computing the Exact Pareto Front in Average-Cost Multi-Objective Markov Decision Processes#2532
Record · ID 1117215
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