Cover Image

Chvátal-Gomory Rounding of Eigenvector Inequalities for QCQPs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dey, Santanu S., Jiang, Nan, Kazachkov, Aleksandr, Lodi, Andrea, Muñoz, Gonzalo
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Extreme Strong Branching for QCQPs
by: Dey, Santanu S., et al.
Published: (2025)

Approximating the Gomory Mixed-Integer Cut Closure Using Historical Data
by: Becu, Berkay, et al.
Published: (2024)

Learn2Aggregate: Supervised Generation of Chvátal-Gomory Cuts Using Graph Neural Networks
by: Deza, Arnaud, et al.
Published: (2024)

Machine Learning for Optimization-Based Separation of Mixed-Integer Rounding Cuts
by: Guaje, Oscar, et al.
Published: (2024)

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

New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
by: Wang, Alex L., et al.
Published: (2021)

$\mathcal{V}$-Polyhedral Disjunctive Cuts
by: Balas, Egon, et al.
Published: (2022)

Approximating value functions via corner Benders' cuts
by: Ota, Matheus J., et al.
Published: (2025)

Symmetrically Fair Allocations of Indivisible Goods
by: Johnston, Connor, et al.
Published: (2024)

Regularized MIP Model for Integrating Energy Storage Systems and its Application for Solving a Trilevel Interdiction Problem
by: Han, Dahye, et al.
Published: (2024)

Inverse of the Gomory Corner Relaxation of Integer Programs
by: Lyu, George, et al.
Published: (2024)

Asymptotically tight Lagrangian dual of smooth nonconvex problems via improved error bound of Shapley-Folkman Lemma
by: Dey, Santanu S, et al.
Published: (2026)

Improving Full Strong Branching Decisions by Incorporating Additional Information
by: Shah, Prachi, et al.
Published: (2025)

Convexification of a Separable Function over a Polyhedral Ground Set
by: Dey, Santanu S., et al.
Published: (2025)

A second-order cone representable class of nonconvex quadratic programs
by: Dey, Santanu S., et al.
Published: (2025)

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

Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
by: Dey, Santanu S., et al.
Published: (2026)

On Sparse Canonical Correlation Analysis
by: Li, Yongchun, et al.
Published: (2023)

Non-Monotonicity of Branching Rules with respect to Linear Relaxations
by: Shah, Prachi, et al.
Published: (2024)

Sensitivity analysis for mixed binary quadratic programming
by: Cifuentes, Diego, et al.
Published: (2023)

Aggregation of Bilinear Bipartite Equality Constraints and its Application to Structural Model Updating Problem
by: Dey, Santanu S, et al.
Published: (2024)

Lagrangian dual with zero duality gap that admits decomposition
by: Cifuentes, Diego, et al.
Published: (2024)

NeuralQP: A General Hypergraph-based Optimization Framework for Large-scale QCQPs
by: Xiong, Zhixiao, et al.
Published: (2024)

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

A reformulation-enumeration MINLP algorithm for gas network design
by: Li, Yijiang, et al.
Published: (2023)

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

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

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. IV. The General Unimodular Two-Dimensional Case
by: Hildebrand, Robert, et al.
Published: (2025)

Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs
by: Dey, Santanu S., et al.
Published: (2024)

Effective Method with Compression for Distributed and Federated Cocoercive Variational Inequalities
by: Medyakov, Daniil, et al.
Published: (2024)

Methods for Solving Variational Inequalities with Markovian Stochasticity
by: Solodkin, Vladimir, et al.
Published: (2024)

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

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

Strengthening Dual Bounds for Multicommodity Capacitated Network Design with Unsplittable Flow Constraints
by: Greening, Lacy M., et al.
Published: (2025)

Extragradient Sliding for Composite Non-Monotone Variational Inequalities
by: Emelyanov, Roman, et al.
Published: (2024)

Cutting Planes for Binarized Network Flow Problems
by: Bonami, Pierre, et al.
Published: (2025)

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

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

Optimal Analysis of Method with Batching for Monotone Stochastic Finite-Sum Variational Inequalities
by: Pichugin, Alexander, et al.
Published: (2024)

Power System State Estimation by Phase Synchronization and Eigenvectors
by: Guzel, Iven, et al.
Published: (2024)