:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Günlük, Oktay, Jünger, Paul, Linderoth, Jeff, Lodi, Andrea, Luedtke, James
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2603.09864
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Decision Making with Fairness over Time
by: Chen, Rui, et al.
Published: (2022)

Probing-Enhanced Stochastic Programming
by: Ma, Zhichao, et al.
Published: (2024)

Fair Clustering with Minimum Representation Constraints
by: Lawless, Connor, et al.
Published: (2024)

Approximate Projections onto the Positive Semidefinite Cone Using Randomization
by: Jones, Morgan, et al.
Published: (2024)

Parallel Token Swapping for Qubit Routing
by: Bansal, Ishan, et al.
Published: (2024)

Factorization-free Orthogonal Projection onto the Positive Semidefinite Cone with Composite Polynomial Filtering
by: Kang, Shucheng, et al.
Published: (2025)

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

Cutting Planes for Binarized Network Flow Problems
by: Bonami, Pierre, 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)

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

Accelerating Benders decomposition for solving a sequence of sample average approximation replications
by: Kothari, Harshit, et al.
Published: (2024)

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

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

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering
by: Sudoso, Antonio M.
Published: (2024)

Sparse Sub-gaussian Random Projections for Semidefinite Programming Relaxations
by: Guedes-Ayala, Monse, et al.
Published: (2024)

Complexity of Chordal Conversion for Sparse Semidefinite Programs with Small Treewidth
by: Zhang, Richard Y.
Published: (2023)

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

On the $p$-order Semismoothness of the Metric Projection onto Slices of the Positive Semidefinite Cone
by: Chen, Ruoning, et al.
Published: (2025)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
by: Proença, Nathan Benedetto, et al.
Published: (2026)

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

A Unified Optimization Framework for Multiclass Classification with Structured Hyperplane Arrangements
by: Blanco, Víctor, et al.
Published: (2025)

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

A Cutting-plane Method for Semidefinite Programming with Potential Applications on Noisy Quantum Devices
by: Marecek, Jakub, et al.
Published: (2021)

Optimal Control on Positive Cones
by: Pates, Richard, et al.
Published: (2024)

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

Analytic Formulas for Alternating Projection Sequences for the Positive Semidefinite Cone and an Application to Convergence Analysis
by: Ochiai, Hiroyuki, et al.
Published: (2024)

TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics
by: Mahajan, Ishaan, et al.
Published: (2026)

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

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

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

Screening Cut Generation for Sparse Ridge Regression
by: Tan, Haozhe, et al.
Published: (2025)

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

DC Semidefinite Programming and Cone Constrained DC Optimization: Theory and Local Search Methods
by: Dolgopolik, M. V.
Published: (2021)

Centering ADMM for the Semidefinite Relaxation of the QAP
by: Kanoh, Shin-ichi, et al.
Published: (2020)

Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut
by: Apte, Anuj, et al.
Published: (2026)

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

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

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

Parametric Semidefinite Programming: Geometry of the Trajectory of Solutions
by: Bellon, Antonio, et al.
Published: (2021)

Postive Semidefinite and Sum of Squares Biquadratic Polynomials
by: Cui, Chunfeng, et al.
Published: (2025)