Imagen de Portada

Counterfactual Explanations for Integer Optimization Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Engelhardt, Felix, Kurtz, Jannis, Birbil, Ş. İlker, Ralphs, Ted
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Counterfactual Explanations for Linear Optimization
por: Kurtz, Jannis, et al.
Publicado: (2024)

Coherent Local Explanations for Mathematical Optimization
por: Otto, Daan, et al.
Publicado: (2025)

Linear Model Extraction via Factual and Counterfactual Queries
por: Otto, Daan, et al.
Publicado: (2026)

Parametric Disjunctive Cuts for Sequences of Mixed Integer Linear Optimization Problems
por: Kelley, Shannon, et al.
Publicado: (2025)

Valid Inequalities for Mixed Integer Bilevel Linear Optimization Problems
por: Tahernejad, Sahar, et al.
Publicado: (2025)

Improving Directions in Mixed Integer Bilevel Linear Optimization
por: Battista, Federico, et al.
Publicado: (2025)

On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem
por: Fallah, Samira, et al.
Publicado: (2023)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
por: Boche, Holger, et al.
Publicado: (2025)

A System-Dynamic Based Simulation and Bayesian Optimization for Inventory Management
por: Maitra, Sarit
Publicado: (2024)

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
por: Tyurin, Alexander
Publicado: (2024)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
por: Chen, Ying, et al.
Publicado: (2025)

From Large Language Models and Optimization to Decision Optimization CoPilot: A Research Manifesto
por: Wasserkrug, Segev, et al.
Publicado: (2024)

Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
por: Jin, Ruiyang, et al.
Publicado: (2025)

Integer Programming Using A Single Atom
por: Goswami, Kapil, et al.
Publicado: (2024)

Optimal Preconditioning is a Geodesically Convex Optimization Problem
por: Doğan, M. Levent, et al.
Publicado: (2025)

Solving The Travelling Salesman Problem Using A Single Qubit
por: Goswami, Kapil, et al.
Publicado: (2024)

Learning An Interpretable Risk Scoring System for Maximizing Decision Net Benefit
por: Chi, Wenhao, et al.
Publicado: (2026)

Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
por: Lu, Yiyang, et al.
Publicado: (2025)

Machine Learning for K-adaptability in Two-stage Robust Optimization
por: Julien, Esther, et al.
Publicado: (2022)

On the Complexity of p-Order Cone Programs
por: Blanco, Víctor, et al.
Publicado: (2025)

Efficient LP warmstarting for linear modifications of the constraint matrix
por: Derval, Guillaume, et al.
Publicado: (2025)

On the Degree Automatability of Sum-of-Squares Proofs
por: Bortolotti, Alex, et al.
Publicado: (2025)

Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
por: Büsing, Christina, et al.
Publicado: (2025)

A parameterized linear formulation of the integer hull
por: Eisenbrand, Friedrich, et al.
Publicado: (2025)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
por: Ketkov, Sergey S., et al.
Publicado: (2024)

Hardness of some optimization problems over correlation polyhedra
por: Caprara, Alberto, et al.
Publicado: (2026)

On the Induced Norms of Matrices and Grothendieck problems
por: Truong, Lan V., et al.
Publicado: (2026)

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
por: Majumdar, Angshul
Publicado: (2026)

Avoiding Deadlocks via Weak Deadlock Sets
por: Oriolo, Gianpaolo, et al.
Publicado: (2024)

Learning complexity of gradient descent and conjugate gradient algorithms
por: Jiao, Xianqi, et al.
Publicado: (2024)

Geometric and computational hardness of bilevel programming
por: Bolte, Jérôme, et al.
Publicado: (2024)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
por: Lee, Jongmin, et al.
Publicado: (2026)

The Complexity of Computing KKT Solutions of Quadratic Programs
por: Fearnley, John, et al.
Publicado: (2023)

Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
por: Sim, Chee-Khian
Publicado: (2024)

On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification
por: Ketkov, Sergey S., et al.
Publicado: (2026)

A parallel framework for graphical optimal transport
por: Fan, Jiaojiao, et al.
Publicado: (2024)

The Complexity of Recognizing Facets for the Knapsack Polytope
por: Chen, Rui, et al.
Publicado: (2022)

Information Redistribution Under Reductions in NP Search
por: Wei, Jing-Yuan
Publicado: (2026)

Bounding the Optimal Number of Policies for Robust K-Adaptability
por: Kurtz, Jannis
Publicado: (2024)

(Sub)Exponential Quantum Speedup for Optimization
por: Leng, Jiaqi, et al.
Publicado: (2025)