arXiv (All)
open access
Inverse Mixed-Integer Programming: Learning Constraints then Objective Functions
Data-driven inverse optimization for mixed-integer linear programs (MILPs), which seeks to learn an objective function and constraints consistent with observed decisions, is important for building accurate mathematical models in a variety of domains, including power systems and scheduling. However,
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
- Regularisation and Parameter Choice Rules for Composite Linear Inverse Problems#1297835
- Exact Methods for Solving k-Delete Recoverable Robust 0-1 Problems Under Budgeted Uncertainty#1077407
- Task-Oriented Quantization for Quadratic Scheduling: Centroid Water-Filling and Power-Diagram Encoders#1034856
- A machine learning framework in static and dynamic inverse problems#410208
- QPCOMP : A quadratic programming based solver for mixed complementarity problems#429989
Record · ID 1201924
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