arXiv (All)
open access
Convexification of classes of mixed-integer sets with L$^\natural$-convexity
L$^\natural$ (natural)-convex functions encompass a large class of nonlinear functions over general integer domains and arise in a wide range of real-world applications. We explore the minimization of L$^\natural$-convex functions, of multiple L$^\natural$-convex functions with common variables, and
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
- Around higher-order Godbersen conjectures#1014816
- Integer Maximization over $\ell_p$ Balls: Hardness and Exact Algorithms#1099921
- Binary Classification with the Maximum Score Model and Linear Programming#792646
- Binary Classification with the Maximum Score Model and Linear Programming#788646
- On splitting properties of the stability problem with integer choice functions#1050991
Record · ID 986803
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