Image de couverture de livre

Extreme Strong Branching for QCQPs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dey, Santanu S., Han, Dahye, Wang, Yang
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Aggregation of Bilinear Bipartite Equality Constraints and its Application to Structural Model Updating Problem
par: Dey, Santanu S, et autres
Publié: (2024)

Chvátal-Gomory Rounding of Eigenvector Inequalities for QCQPs
par: Dey, Santanu S., et autres
Publié: (2026)

Improving Full Strong Branching Decisions by Incorporating Additional Information
par: Shah, Prachi, et autres
Publié: (2025)

Regularized MIP Model for Integrating Energy Storage Systems and its Application for Solving a Trilevel Interdiction Problem
par: Han, Dahye, et autres
Publié: (2024)

Non-Monotonicity of Branching Rules with respect to Linear Relaxations
par: Shah, Prachi, et autres
Publié: (2024)

New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs
par: Wang, Alex L., et autres
Publié: (2021)

Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs
par: Dey, Santanu S., et autres
Publié: (2024)

Convexification of a Separable Function over a Polyhedral Ground Set
par: Dey, Santanu S., et autres
Publié: (2025)

A second-order cone representable class of nonconvex quadratic programs
par: Dey, Santanu S., et autres
Publié: (2025)

Asymptotically tight Lagrangian dual of smooth nonconvex problems via improved error bound of Shapley-Folkman Lemma
par: Dey, Santanu S, et autres
Publié: (2026)

Learning in Spatial Branching: Limitations of Strong Branching Imitation
par: González-Rodríguez, Brais, et autres
Publié: (2024)

Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
par: Dey, Santanu S., et autres
Publié: (2026)

On Sparse Canonical Correlation Analysis
par: Li, Yongchun, et autres
Publié: (2023)

Sensitivity analysis for mixed binary quadratic programming
par: Cifuentes, Diego, et autres
Publié: (2023)

Lagrangian dual with zero duality gap that admits decomposition
par: Cifuentes, Diego, et autres
Publié: (2024)

NeuralQP: A General Hypergraph-based Optimization Framework for Large-scale QCQPs
par: Xiong, Zhixiao, et autres
Publié: (2024)

A reformulation-enumeration MINLP algorithm for gas network design
par: Li, Yijiang, et autres
Publié: (2023)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
par: Kannan, Rohit, et autres
Publié: (2022)

Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model
par: Mexi, Gioni, et autres
Publié: (2023)

Strengthening Dual Bounds for Multicommodity Capacitated Network Design with Unsplittable Flow Constraints
par: Greening, Lacy M., et autres
Publié: (2025)

Approximating the Gomory Mixed-Integer Cut Closure Using Historical Data
par: Becu, Berkay, et autres
Publié: (2024)

Mixed-Integer Programming for Change-point Detection
par: Narula, Apoorva, et autres
Publié: (2026)

Geoffrion's theorem beyond finiteness and rationality
par: Dey, Santanu S., et autres
Publié: (2025)

Accelerating Column Generation in Highly Degenerate Integer Programming Problems with Template Pricing
par: Marshall, Luke, et autres
Publié: (2026)

Separable QCQPs and Their Exact SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2026)

Homotopy Continuation Enhanced Branch and Bound Algorithms for Strongly Nonconvex Mixed-Integer Nonlinear Programming Problems
par: Ma, Yingjie, et autres
Publié: (2021)

Branch & Solve for Hub Location
par: Fernández, Elena, et autres
Publié: (2025)

The Branch-and-Bound Tree Closure
par: Roland, Marius, et autres
Publié: (2025)

On Branch-and-Price for Project Scheduling
par: Kolter, Maximilian, et autres
Publié: (2025)

A Branch and Bound Algorithm for Multiobjective Optimization Problems Using General Ordering Cones
par: Wu, Weitian, et autres
Publié: (2024)

Optimizing rake-links independently of timetables in railway operations
par: Dey, Sourav
Publié: (2025)

Theoretical Challenges in Learning for Branch-and-Cut
par: Cheng, Hongyu, et autres
Publié: (2026)

Branching Adaptive Surrogate Search Optimization (BASSO)
par: Maneekul, Pariyakorn, et autres
Publié: (2025)

Adaptive Output Feedback MPC with Guaranteed Stability and Robustness
par: Dey, Anchita, et autres
Publié: (2025)

Security of Distributed Parameter Cyber-Physical Systems: Cyber-Attack Detection in Linear Parabolic PDEs
par: Roy, Tanushree, et autres
Publié: (2021)

Output Feedback MPC with Adaptive Tubes
par: Dey, Anchita, et autres
Publié: (2026)

Adaptive Tube MPC: Beyond a Common Quadratically Stabilizing Feedback Gain
par: Dey, Anchita, et autres
Publié: (2026)

Computation of Maximal Admissible Robust Positive Invariant Sets for Linear Systems with Parametric and Additive Uncertainties
par: Dey, Anchita, et autres
Publié: (2024)

Revisiting Strong Duality, Hidden Convexity, and Gradient Dominance in the Linear Quadratic Regulator
par: Watanabe, Yuto, et autres
Publié: (2025)

CoNeT-GIANT: A compressed Newton-type fully distributed optimization algorithm
par: Das, Souvik, et autres
Publié: (2025)