Cover Image

Relax-and-Cut for Temporal SCUC Decomposition

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xiong, Jinxin, Yang, Linxin, Wang, Yingxiao, Huang, Yanting, Wu, Jianghua, Lei, Shunbo, Wang, Akang
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems
by: Qiu, Yeqing, et al.
Published: (2024)

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

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

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

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

Promoting Fair Online Resource Allocation with Indivisible Units
by: Averbakh, Igor, et al.
Published: (2026)

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

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

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

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

Deepest Cuts for Benders Decomposition
by: Hosseini, Mojtaba, et al.
Published: (2021)

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

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

PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming
by: Li, Bingheng, et al.
Published: (2024)

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

Sample Robust Scheduling of Electricity-Gas Systems Under Wind Power Uncertainty
by: Liu, Rong-Peng, et al.
Published: (2023)

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

Learning to Cut: Reinforcement Learning for Benders Decomposition
by: Cai, Haochen, et al.
Published: (2026)

GPU-based Split algorithm for Large-Scale CVRPSD
by: Zhao, Jingyi, et al.
Published: (2025)

Complexity Analysis of the Regular Simplicial Search Method with Reflection and Shrinking Steps for Derivative-Free Optimization
by: Cao, Liyuan, et al.
Published: (2025)

Tricks from the Trade for Large-Scale Markdown Pricing: Heuristic Cut Generation for Lagrangian Decomposition
by: Streeck, Robert, et al.
Published: (2024)

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

Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum
by: Wang, Bofan, et al.
Published: (2024)

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

A Cutting-plane and Benders' Decomposition Algorithm for Two-Stage Distributionally Robust Convex programs
by: Luo, Fengqiao, et al.
Published: (2021)

Nonlinear Dynamical Unbalanced Optimal Transport: Relaxation and Duality
by: Wu, Dongjun, et al.
Published: (2025)

Temporal and Spatial Decomposition for Prospective Studies in Energy Systems under Uncertainty
by: Parra, Camila Martinez, et al.
Published: (2025)

Accelerating Stochastic Energy System Optimization Models: Temporally Split Benders Decomposition
by: Sasanpour, Shima, et al.
Published: (2025)

Regularization in Data-driven Predictive Control: A Convex Relaxation Perspective
by: Shang, Xu, et al.
Published: (2025)

From Maximum Cut to Maximum Independent Set
by: Wu, Chuixiong, et al.
Published: (2024)

Safe and Stable Filter Design Using a Relaxed Compatibitlity Control Barrier -- Lyapunov Condition
by: Wang, Han, et al.
Published: (2024)

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

A Dynamic Relaxation Framework for Global Solution of ACOPF
by: Tang, Yu-Yang, et al.
Published: (2025)

MIP Relaxations in Factorable Programming
by: He, Taotao, et al.
Published: (2023)

Affine FR: an Effective Facial Reduction Algorithm for Semidefinite Relaxations of Combinatorial Problems
by: Hu, Hao, et al.
Published: (2024)

Benders Decomposition for Passenger-Oriented Train Timetabling with Hybrid Periodicity
by: Yao, Zhiyuan, et al.
Published: (2025)

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