:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lv, Wei, Chen, Wei-Kun, Chen, Yi-Long, Dai, Yu-Hong
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2402.18795
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Benders decomposition for the large-scale probabilistic set covering problem
by: Liang, Jie, et al.
Published: (2025)

An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
by: Chen, Wei-Kun, et al.
Published: (2024)

An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem
by: Wang, Yan-Ru, et al.
Published: (2025)

Presolving and cutting planes for the generalized maximal covering location problem
by: Lv, Wei, et al.
Published: (2024)

Benders decomposition for congested partial set covering location with uncertain demand
by: Calamita, Alice, et al.
Published: (2024)

An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
by: Guo, Yu-Qi, et al.
Published: (2025)

A decomposition-based approach for large-scale pickup and delivery problems
by: Hiermann, G., et al.
Published: (2024)

Polyhedral results for two classes of submodular sets with GUB constraints
by: Qian, Weikang, et al.
Published: (2026)

A computationally efficient Benders decomposition for energy systems planning problems with detailed operations and time-coupling constraints
by: Jacobson, Anna, et al.
Published: (2023)

An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing
by: Chen, Wei-Kun, et al.
Published: (2023)

On strong valid inequalities for a class of mixed-integer nonlinear sets with box constraints
by: Li, Keyan, et al.
Published: (2026)

Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
by: Locatelli, Marco, et al.
Published: (2022)

Integrated demand-side management and timetabling for an urban rail transit line: A Benders decomposition approach
by: Yang, Lixing, et al.
Published: (2025)

Stabilized Benders decomposition for energy planning under climate uncertainty
by: Göke, Leonard, et al.
Published: (2022)

Learning to control inexact Benders decomposition via reinforcement learning
by: Li, Zhe, et al.
Published: (2025)

Clustering-enhanced adaptive Benders decomposition for energy systems planning optimization
by: Law, Jun Wen, et al.
Published: (2026)

The large-scale charging scheduling problem for fleet batteries: Lagrangian decomposition with time-block reformulations
by: Fotedar, Sunney, et al.
Published: (2025)

Exploiting Overlap Information in Chance-constrained Program with Random Right-hand Side
by: Lv, Wei, et al.
Published: (2024)

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

Computationally efficient solution of mixed integer model predictive control problems via machine learning aided Benders Decomposition
by: Mitrai, Ilias, et al.
Published: (2023)

Adaptive Benders decomposition and enhanced SDDP for multistage stochastic programs with block-separable multistage recourse
by: Mazzi, Nicolò, et al.
Published: (2025)

Efficient exact sequential lifting algorithm for binary knapsack set
by: Wang, Xintong, et al.
Published: (2026)

Disjunctive Benders Decomposition
by: Fang, Kaiwen, et al.
Published: (2025)

Integrating quantum and classical computing for multi-energy system optimization using Benders decomposition
by: Leenders, Ludger, et al.
Published: (2023)

Formulations of the continuous set-covering problem on networks: a comparative study
by: Xu, Liding, et al.
Published: (2024)

The dual-path fixing strategy and its application to the set-covering problem
by: Yamagishi, Paulo Michel F., et al.
Published: (2026)

Integrated investment, retrofit and abandonment energy system planning with multi-timescale uncertainty using stabilised adaptive Benders decomposition
by: Zhang, Hongyu, et al.
Published: (2023)

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

Analyzing Performance and Scalability of Benders Decomposition for Generation and Transmission Expansion Planning Models
by: Cole, David L., et al.
Published: (2026)

A Benders and column generation method to the integrated airline schedule and aircraft recovery with gate reassignment
by: Jiang, Jianlin, et al.
Published: (2025)

Feasibility-Aware Imitation Learning for Benders Decomposition
by: Agyeman, Bernard T., et al.
Published: (2026)

An efficient penalty decomposition algorithm for minimization over sparse symmetric sets
by: Mousavi, Ahmad, et al.
Published: (2026)

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

Multi-period stochastic covering location problems: Modeling framework and solution approach
by: Marín, Alfredo, et al.
Published: (2024)

Fast and memory-efficient optimization for large-scale data-driven predictive control
by: Schmitz, Philipp, et al.
Published: (2024)

The probabilistic p-center problem: Planning service for potential customers
by: Martínez-Merino, Luisa I., et al.
Published: (2024)

Benders Decomposition for Bi-objective Linear Programs
by: Raith, Andrea, et al.
Published: (2022)

Extracting Alternative Solutions from Benders Decomposition
by: Viens, Matthew, et al.
Published: (2025)

QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks
by: Chen, Wei-Kun, et al.
Published: (2024)

Accelerated Over-Relaxation Heavy-Ball Method: Achieving Global Accelerated Convergence with Broad Generalization
by: Wei, Jingrong, et al.
Published: (2024)