arXiv (All)
open access
Disjunctive Submodular Functions: Envelopes and Applications to Inventory and 0-1 Quadratic Optimization
This paper considers convex envelopes of disjunctive submodular functions---functions that are lattice family submodular over faces of a hypercube---and constructs the first strongly polynomial algorithm for their separation when there are two facial disjunctions. Submodular functions, whose convex
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
- An Approximation Algorithm for Monotone Submodular Cost Allocation#1012077
- Computing the convex envelope of bivariate piecewise linear-quadratic functions in linear time#1013940
- The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem#1123200
- Second-Order KKT Guarantees for Bregman ADMM in Nonconvex and Non-Lipschitz Optimization#319654
- On the Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs *#796467
Record · ID 1105271
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