Cover Image

ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Qiu, Yeqing, Xue, Ye, Wang, Akang, Wang, Yiheng, Shi, Qingjiang, Luo, Zhi-Quan
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Mixed-Integer Linear Optimization via Learning-Based Two-Layer Large Neighborhood Search
by: Liu, Wenbo, et al.
Published: (2024)

Relax-and-Cut for Temporal SCUC Decomposition
by: Xiong, Jinxin, et al.
Published: (2025)

IPM-LSTM: A Learning-Based Interior Point Method for Solving Nonlinear Programs
by: Gao, Xi, et al.
Published: (2024)

On Representing Convex Quadratically Constrained Quadratic Programs via Graph Neural Networks
by: Wu, Chenyang, et al.
Published: (2024)

Parallel Graver Basis Extraction for Nonlinear Integer Optimization
by: Liu, Wenbo, et al.
Published: (2024)

Data Clustering and Visualization with Recursive Max k-Cut Algorithm
by: Ly, An, et al.
Published: (2024)

When GNNs meet symmetry in ILPs: an orbit-based feature augmentation approach
by: Chen, Qian, et al.
Published: (2025)

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

Finite Horizon Optimization: Framework and Applications
by: Zhang, Yushun, et al.
Published: (2024)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
by: Zhang, Jiawei, et al.
Published: (2020)

SymILO: A Symmetry-Aware Learning Framework for Integer Linear Optimization
by: Chen, Qian, et al.
Published: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)

Solving Quadratic Programs via Deep Unrolled Douglas-Rachford Splitting
by: Xiong, Jinxin, et al.
Published: (2025)

A Max-Min-Max Algorithm for Large-Scale Robust Optimization
by: Tu, Kai, et al.
Published: (2024)

Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
by: Salem, Jad, et al.
Published: (2024)

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

Decentralized Stochastic Nonconvex Optimization under the Relaxed Smoothness
by: Luo, Luo, et al.
Published: (2025)

Smoothing Binary Optimization: A Primal-Dual Perspective
by: Liu, Wenbo, et al.
Published: (2025)

A Learning-Based Inexact ADMM for Solving Quadratic Programs
by: Gao, Xi, et al.
Published: (2025)

Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks
by: Qiu, Yeqing, et al.
Published: (2025)

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

From Majorization to Scaling: Advancing Convex Relaxations of Maximum Entropy Sampling Problem
by: Shen, Lingqing, et al.
Published: (2026)

Decentralized Min-Max Optimization with Gradient Tracking
by: You, Runze, et al.
Published: (2025)

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

A Distributed Gradient-based Algorithm for Optimization Problems with Coupled Equality Constraints
by: Qiu, Chenyang, et al.
Published: (2025)

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

Diffusion Stochastic Optimization for Min-Max Problems
by: Cai, Haoyuan, et al.
Published: (2024)

A Hybrid Relaxation-Heuristic Framework for Solving MIP with Binary Variables
by: Wang, Zayn
Published: (2026)

A Modelling Framework for Energy-Management and Eco-Driving Problems using Convex Relaxations
by: Heuts, Y. J. J., et al.
Published: (2024)

An Efficient Unsupervised Framework for Convex Quadratic Programs via Deep Unrolling
by: Yang, Linxin, et al.
Published: (2024)

Relaxed Lagrangian Approach to First-Order Non-Convex Mean Field Type Control Problem
by: Mendico, Cristian, et al.
Published: (2024)

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

Min-Max Connected Multiway Cut
by: Tiwary, Hans Raj, et al.
Published: (2026)

A Dynamic Unmanned Aerial Vehicle Routing Framework for Urban Traffic Monitoring
by: Bai, Yumeng, et al.
Published: (2025)

A Novel Mixed-Integer Linear Programming Formulation for Continuous-Time Inventory Routing
by: Wang, Akang, et al.
Published: (2023)

Successive Fixing for Large-Scale SCUC Using First-Order Methods
by: Xiong, Jinxin, et al.
Published: (2025)

Exploiting Low-Rank Structure in Max-K-Cut Problems
by: Stevens, Ria, et al.
Published: (2026)

A Relaxed Control Problem With $L^\infty$ Cost and Jump Dynamics Motivated by Cyber Risks Insurance
by: Goreac, Dan, et al.
Published: (2025)

Exactness Conditions for Semidefinite Relaxations of the Quadratic Assignment Problem
by: Chen, Junyu, et al.
Published: (2024)

On the Strength of Linear Relaxations in Ordered Optimization
by: Blanco, Víctor, et al.
Published: (2025)