{"total":17,"rows":[{"id":"2307.13565","title":"Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunities","created":"2023-07-25","cited_by_count":130,"area":null},{"id":"2103.01826","title":"Strategic Classification Made Practical","created":"2021-03-02","cited_by_count":59,"area":null},{"id":"2105.02343","title":"CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints","created":"2021-05-05","cited_by_count":49,"area":null},{"id":"2301.11260","title":"Maximum Optimality Margin: A Unified Approach for Contextual Linear Programming and Inverse Linear Programming","created":"2023-01-26","cited_by_count":13,"area":null},{"id":"2103.17232","title":"Neuro-Symbolic Constraint Programming for Structured Prediction","created":"2021-03-31","cited_by_count":11,"area":null},{"id":"2309.00203","title":"Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming","created":"2023-09-01","cited_by_count":10,"area":null},{"id":"2410.06324","title":"Differentiation Through Black-Box Quadratic Programming Solvers","created":"2024-10-08","cited_by_count":10,"area":null},{"id":"2501.14349","title":"Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound","created":"2025-01-24","cited_by_count":9,"area":null},{"id":"2501.13648","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","created":"2025-01-23","cited_by_count":8,"area":null},{"id":"2210.09082","title":"A Solver-Free Framework for Scalable Learning in Neural ILP Architectures","created":"2022-10-17","cited_by_count":5,"area":null},{"id":"2102.12415","title":"Using Inverse Optimization to Learn Cost Functions in Generalized Nash Games","created":"2021-02-24","cited_by_count":3,"area":null},{"id":"2107.07136","title":"Learning Mixed-Integer Linear Programs from Contextual Examples","created":"2021-07-15","cited_by_count":2,"area":null},{"id":"2204.06895","title":"Gradient boosting for convex cone predict and optimize problems","created":"2022-04-14","cited_by_count":1,"area":null},{"id":"2209.10493","title":"Social-Inverse: Inverse Decision-making of Social Contagion Management with Task Migrations","created":"2022-09-21","cited_by_count":1,"area":null},{"id":"2509.15999","title":"Inverse Optimization Latent Variable Models for Learning Costs Applied to Route Problems","created":"2025-09-19","cited_by_count":0,"area":null},{"id":"2608.07398","title":"Uncovering expert objectives in production planning via inverse optimization: An industrial case study","created":"2026-08-07","cited_by_count":0,"area":null},{"id":"2609.38434","title":"TACIT: Optimization Models that Learn from Their Mistakes","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}