Cover Image

Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Messana, Rosario, Chen, Rui, Lodi, Andrea, Ceselli, Alberto
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget
by: Barbato, Michele, et al.
Published: (2024)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
by: Scavuzzo, Lara, et al.
Published: (2024)

Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
by: Chen, Hao, et al.
Published: (2026)

Batched First-Order Methods for Parallel LP Solving in MIP
by: Blin, Nicolas, et al.
Published: (2026)

A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
by: Chen, Xi, et al.
Published: (2024)

Towards An Unsupervised Learning Scheme for Efficiently Solving Parameterized Mixed-Integer Programs
by: Qu, Shiyuan, et al.
Published: (2024)

How hard is learning to cut? Trade-offs and sample complexity
by: Khalife, Sammy, et al.
Published: (2025)

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs
by: Liu, Jiachang, et al.
Published: (2026)

Accelerated Nonnegative Tensor Completion via Integer Programming
by: Pan, Wenhao, et al.
Published: (2022)

Scalable First-order Method for Certifying Optimal k-Sparse GLMs
by: Liu, Jiachang, et al.
Published: (2025)

Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location
by: Lodi, Andrea, et al.
Published: (2019)

GPU-friendly and Linearly Convergent First-order Methods for Certifying Optimal $k$-sparse GLMs
by: Liu, Jiachang, et al.
Published: (2026)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
by: Hutchinson, Spencer, et al.
Published: (2024)

Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees
by: Ovalle, Daniel, et al.
Published: (2025)

Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(ε^{-4/7})$ Second-Order Oracle Complexity
by: Chen, Lesi, et al.
Published: (2025)

Expressive Power of Graph Neural Networks for (Mixed-Integer) Quadratic Programs
by: Chen, Ziang, et al.
Published: (2024)

Learning Cut Generating Functions for Integer Programming
by: Cheng, Hongyu, et al.
Published: (2024)

Mixed-Integer Programming for Change-point Detection
by: Narula, Apoorva, et al.
Published: (2026)

The Differentiable Feasibility Pump
by: Cacciola, Matteo, et al.
Published: (2024)

Proximal Oracles for Optimization and Sampling
by: Liang, Jiaming, et al.
Published: (2024)

A Distance Metric for Mixed Integer Programming Instances
by: Maudet, Gwen, et al.
Published: (2025)

On Integer Programming for the Binarized Neural Network Verification Problem
by: Kim, Woojin, et al.
Published: (2025)

Scalable Mixed-Integer Optimization with Neural Constraints via Dual Decomposition
by: Zeng, Shuli, et al.
Published: (2025)

Mixed-Integer Linear Programming Approximations for the Stochastic Knapsack
by: Rossi, Roberto, et al.
Published: (2025)

Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming
by: Cheng, Hongyu, et al.
Published: (2025)

Predicting Accurate Lagrangian Multipliers for Mixed Integer Linear Programs
by: Demelas, Francesco, et al.
Published: (2023)

Inverse Mixed-Integer Programming: Learning Constraints then Objective Functions
by: Kitaoka, Akira
Published: (2025)

Effective Generation of Feasible Solutions for Integer Programming via Guided Diffusion
by: Zeng, Hao, et al.
Published: (2024)

Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees
by: Tang, Bo, et al.
Published: (2024)

Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching
by: Bayramoğlu, Selin, et al.
Published: (2026)

Differentiable Integer Linear Programming is not Differentiable & it's not a mere technical problem
by: Sornwanee, Thanawat
Published: (2026)

SMiLE: Provably Enforcing Global Relational Properties in Neural Networks
by: Francobaldi, Matteo, et al.
Published: (2025)

Minimisation of Polyak-Łojasewicz Functions Using Random Zeroth-Order Oracles
by: Farzin, Amir Ali, et al.
Published: (2024)

Single- vs. Dual-Policy Reinforcement Learning for Dynamic Bike Rebalancing
by: Liang, Jiaqi, et al.
Published: (2024)

Tensor Completion via Integer Optimization
by: Chen, Xin, et al.
Published: (2024)

Solving Parameter-Robust Avoid Problems with Unknown Feasibility using Reinforcement Learning
by: So, Oswin, et al.
Published: (2026)

An improved column-generation-based matheuristic for learning classification trees
by: Patel, Krunal Kishor, et al.
Published: (2023)

Solving Truly Massive Budgeted Monotonic POMDPs with Oracle-Guided Meta-Reinforcement Learning
by: Vora, Manav, et al.
Published: (2024)

Exact Verification of First-Order Methods via Mixed-Integer Linear Programming
by: Ranjan, Vinit, et al.
Published: (2024)

A Unified Approach to Extract Interpretable Rules from Tree Ensembles via Integer Programming
by: Bonasera, Lorenzo, et al.
Published: (2024)