Benders decomposition for the large-scale probabilistic set covering problem
Fuente:
arXiv
Saved in:
| Main Authors: | Liang, Jie, Yu, Cheng-Yang, Lv, Wei, Chen, Wei-Kun, Dai, Yu-Hong |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach
by: Lv, Wei, et al.
Published: (2024)
by: Lv, Wei, et al.
Published: (2024)
Presolving and cutting planes for the generalized maximal covering location problem
by: Lv, Wei, et al.
Published: (2024)
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)
by: Calamita, Alice, et al.
Published: (2024)
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)
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)
by: Wang, Yan-Ru, et al.
Published: (2025)
Polyhedral results for two classes of submodular sets with GUB constraints
by: Qian, Weikang, et al.
Published: (2026)
by: Qian, Weikang, et al.
Published: (2026)
On strong valid inequalities for a class of mixed-integer nonlinear sets with box constraints
by: Li, Keyan, et al.
Published: (2026)
by: Li, Keyan, et al.
Published: (2026)
A decomposition-based approach for large-scale pickup and delivery problems
by: Hiermann, G., et al.
Published: (2024)
by: Hiermann, G., et al.
Published: (2024)
An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing
by: Chen, Wei-Kun, et al.
Published: (2023)
by: Chen, Wei-Kun, et al.
Published: (2023)
Efficient exact sequential lifting algorithm for binary knapsack set
by: Wang, Xintong, et al.
Published: (2026)
by: Wang, Xintong, et al.
Published: (2026)
Learning to control inexact Benders decomposition via reinforcement learning
by: Li, Zhe, et al.
Published: (2025)
by: Li, Zhe, et al.
Published: (2025)
Stabilized Benders decomposition for energy planning under climate uncertainty
by: Göke, Leonard, et al.
Published: (2022)
by: Göke, Leonard, et al.
Published: (2022)
A computationally efficient Benders decomposition for energy systems planning problems with detailed operations and time-coupling constraints
by: Jacobson, Anna, et al.
Published: (2023)
by: Jacobson, Anna, et al.
Published: (2023)
Clustering-enhanced adaptive Benders decomposition for energy systems planning optimization
by: Law, Jun Wen, et al.
Published: (2026)
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)
by: Fotedar, Sunney, et al.
Published: (2025)
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)
by: Guo, Yu-Qi, et al.
Published: (2025)
Accelerating Benders decomposition for solving a sequence of sample average approximation replications
by: Kothari, Harshit, et al.
Published: (2024)
by: Kothari, Harshit, et al.
Published: (2024)
Integrated demand-side management and timetabling for an urban rail transit line: A Benders decomposition approach
by: Yang, Lixing, et al.
Published: (2025)
by: Yang, Lixing, et al.
Published: (2025)
Adaptive Benders decomposition and enhanced SDDP for multistage stochastic programs with block-separable multistage recourse
by: Mazzi, Nicolò, et al.
Published: (2025)
by: Mazzi, Nicolò, et al.
Published: (2025)
Exploiting Overlap Information in Chance-constrained Program with Random Right-hand Side
by: Lv, Wei, et al.
Published: (2024)
by: Lv, Wei, et al.
Published: (2024)
A Benders and column generation method to the integrated airline schedule and aircraft recovery with gate reassignment
by: Jiang, Jianlin, et al.
Published: (2025)
by: Jiang, Jianlin, et al.
Published: (2025)
A Dynamic Relaxation Framework for Global Solution of ACOPF
by: Tang, Yu-Yang, et al.
Published: (2025)
by: Tang, Yu-Yang, et al.
Published: (2025)
The dual-path fixing strategy and its application to the set-covering problem
by: Yamagishi, Paulo Michel F., et al.
Published: (2026)
by: Yamagishi, Paulo Michel F., et al.
Published: (2026)
Formulations of the continuous set-covering problem on networks: a comparative study
by: Xu, Liding, et al.
Published: (2024)
by: Xu, Liding, et al.
Published: (2024)
Learning to Cut: Reinforcement Learning for Benders Decomposition
by: Cai, Haochen, et al.
Published: (2026)
by: Cai, Haochen, et al.
Published: (2026)
Disjunctive Benders Decomposition
by: Fang, Kaiwen, et al.
Published: (2025)
by: Fang, Kaiwen, et al.
Published: (2025)
Integrated investment, retrofit and abandonment energy system planning with multi-timescale uncertainty using stabilised adaptive Benders decomposition
by: Zhang, Hongyu, et al.
Published: (2023)
by: Zhang, Hongyu, et al.
Published: (2023)
Integrating quantum and classical computing for multi-energy system optimization using Benders decomposition
by: Leenders, Ludger, et al.
Published: (2023)
by: Leenders, Ludger, et al.
Published: (2023)
A mechanism of three-dimensional quadratic termination for the gradient method with applications
by: Huang, Yakui, et al.
Published: (2022)
by: Huang, Yakui, et al.
Published: (2022)
Deepest Cuts for Benders Decomposition
by: Hosseini, Mojtaba, et al.
Published: (2021)
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)
by: Cole, David L., et al.
Published: (2026)
The probabilistic p-center problem: Planning service for potential customers
by: Martínez-Merino, Luisa I., et al.
Published: (2024)
by: Martínez-Merino, Luisa I., et al.
Published: (2024)
Feasibility-Aware Imitation Learning for Benders Decomposition
by: Agyeman, Bernard T., et al.
Published: (2026)
by: Agyeman, Bernard T., et al.
Published: (2026)
Extracting Alternative Solutions from Benders Decomposition
by: Viens, Matthew, et al.
Published: (2025)
by: Viens, Matthew, et al.
Published: (2025)
Benders Decomposition for Bi-objective Linear Programs
by: Raith, Andrea, et al.
Published: (2022)
by: Raith, Andrea, et al.
Published: (2022)
Enhanced Barrier-Smoothing Technique for Bilevel Optimization with Nonsmooth Mappings
by: Xu, Mengwei, et al.
Published: (2024)
by: Xu, Mengwei, 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)
by: Mitrai, Ilias, et al.
Published: (2023)
On second-order weak sharp minima of general nonconvex set-constrained optimization problems
by: Ma, Xiaoxiao, et al.
Published: (2025)
by: Ma, Xiaoxiao, et al.
Published: (2025)
New second-order optimality conditions for directional optimality of a general set-constrained optimization problem
by: Ouyang, Wei, et al.
Published: (2024)
by: Ouyang, Wei, et al.
Published: (2024)
A 140 line MATLAB code for topology optimization problems with probabilistic parameters
by: Uihlein, Andrian, et al.
Published: (2025)
by: Uihlein, Andrian, et al.
Published: (2025)
Similar Items
-
Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach
by: Lv, Wei, et al.
Published: (2024) -
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 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)