Imagen de Portada

Cutting Planes for Binarized Network Flow Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bonami, Pierre, Dash, Sanjeeb, Derkach, Anton, Lodi, Andrea
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes
por: van Rossum, Bart, et al.
Publicado: (2026)

Sparse Cuts for the Positive Semidefinite Cone
por: Günlük, Oktay, et al.
Publicado: (2026)

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

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

Advanced Cutting-Plane Algorithms for ACOPF
por: Bienstock, Daniel, et al.
Publicado: (2025)

The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations
por: Carvalho, Margarida, et al.
Publicado: (2021)

Accurate Linear Cutting-Plane Relaxations for ACOPF
por: Bienstock, Daniel, et al.
Publicado: (2023)

Electric Vehicle Scheduling and Vehicle-to-Grid Integration in Microgrids
por: Cho, Nathan, et al.
Publicado: (2025)

A Linear and Scalable Cutting-Plane Algorithm for Electricity Pricing
por: Romero, Matías, et al.
Publicado: (2025)

Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF
por: Bienstock, Daniel, et al.
Publicado: (2024)

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

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

Learning to Select Cutting Planes in Mixed Integer Linear Programming Solving
por: Zhang, Xuefeng, et al.
Publicado: (2024)

Efficient Branching Rules for Optimizing Range and Order-Based Objective Functions
por: van Rossum, Bart, et al.
Publicado: (2023)

A Parallelized Cutting-Plane Algorithm for Computationally Efficient Modelling to Generate Alternatives
por: Lau, Michael, et al.
Publicado: (2025)

Active Learning of Deep Neural Networks via Gradient-Free Cutting Planes
por: Zhang, Erica, et al.
Publicado: (2024)

Accelerated windowing for the crew rostering problem with machine learning
por: Racette, Philippe, et al.
Publicado: (2025)

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

Evolving Scientific Discovery by Unifying Data and Background Knowledge with AI Hilbert
por: Cory-Wright, Ryan, et al.
Publicado: (2023)

Efficient Graph Partitioning under Resource Constraints: A Cutting-Plane Framework for Distribution Grids
por: Nguyen, Duong Thuy Anh, et al.
Publicado: (2026)

Chance-constrained battery management strategies for the electric bus scheduling problem
por: Ricard, Léa, et al.
Publicado: (2025)

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

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

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

Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes
por: Zhou, Duo, et al.
Publicado: (2024)

Chvátal-Gomory Rounding of Eigenvector Inequalities for QCQPs
por: Dey, Santanu S., et al.
Publicado: (2026)

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

Learning to reoptimize: a GNN-aided fix-and-optimize approach and an application to the Lot Sizing problem
por: Lerouge, Mathieu, et al.
Publicado: (2026)

Solving Large Multicommodity Network Flow Problems on GPUs
por: Zhang, Fangzhao, et al.
Publicado: (2025)

Solving Unsplittable Network Flow Problems with Decision Diagrams
por: Salemi, Hosseinali, et al.
Publicado: (2023)

Valid Cuts for the Design of Potential-based Flow Networks
por: Börner, Pascal, et al.
Publicado: (2025)

Disjunctive Sum of Squares
por: Ahmadi, Amir Ali, et al.
Publicado: (2026)

Taming Binarized Neural Networks and Mixed-Integer Programs
por: Aspman, Johannes, et al.
Publicado: (2023)

Optimization by Directional Attacks: Solving Problems with Neural Network Surrogates
por: Bouchet, Pierre-Yves, et al.
Publicado: (2025)

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

Applying Quantum Computing to Solve Multicommodity Network Flow Problem
por: Chence, Niu, et al.
Publicado: (2024)

Applications of Lifted Nonlinear Cuts to Convex Relaxations of the AC Power Flow Equations
por: Bugosen, Sergio I., et al.
Publicado: (2024)

The Differentiable Feasibility Pump
por: Cacciola, Matteo, et al.
Publicado: (2024)

Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles
por: Messana, Rosario, et al.
Publicado: (2024)

Learning Large Neighborhood Search for Maritime Inventory Routing Optimization
por: Chen, Rui, et al.
Publicado: (2025)