HAL (France)
open access
Learning Capacity Constraints with Convex Neural Networks in Lot-Sizing Problems
This paper presents a novel approach for integrating convex neural networks into mixed-integer linear programs. We introduce a mixed-integer linear programming formulation that employs the Maxout activation function, and our experiments show that this network type outperforms rectified linear unit–b
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
- Bellman Error Minimization Via Linear Programming Normalization#1187044
- Extended Formulations in Mixed-Integer Convex Programming#364420
- Optimizing Sparse Boolean Rule Networks using Mixed Integer Linear Programming#1355103
- Acceleration for Affine-coupling problems#1132198
- A Tardos-Type Algorithm for Separable Convex Quadratic Programming#1216840
Record · ID 1235837
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