Koc University Digital Collections
metadata only
On the complexity and approximation of the maximum expected value all-or-nothing subset
An unconstrained nonlinear binary optimization problem of selecting a maximum expected value subset of items is considered. Each item is associated with a profit and probability. Each of the items succeeds or fails independently with the given probabilities, and the profit is obtained in the event t
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
- Extremal Families for the Erdős--Kleitman Problem: The Missing Constructions#800116
- Binary Fick’s Law Algorithm Based on L-Shaped Transfer Function for Solving the 0-1 Knapsack Problem#438707
- Set System Approximation for Binary Integer Programs: Reformulations and Applications#1062808
- 0/1 Constrained Optimization Solving Sample Average Approximation for Chance Constrained Programming#146974
- Binary Firefly algorithm for the set covering problem [Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos]#948660
Record · ID 954991
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