Image de couverture de livre

Exploiting Overlap Information in Chance-constrained Program with Random Right-hand Side

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lv, Wei, Chen, Wei-Kun, Dai, Yu-Hong, Tong, Xiao-Jiao
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control 90C11, 90C15
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Adaptive Partitioning for Chance-Constrained Problems with Finite Support
par: Roland, Marius, et autres
Publié: (2023)

A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
par: Davarnia, Danial, et autres
Publié: (2025)

Distributionally Risk-Receptive and Robust Multistage Stochastic Integer Programs and Interdiction Models
par: Kang, Sumin, et autres
Publié: (2024)

Bi-Parameterized Two-Stage Stochastic Min-Max and Min-Min Mixed Integer Programs
par: Kang, Sumin, et autres
Publié: (2025)

Multi-timescale Stochastic Programming with Applications in Power Systems
par: Zhang, Yihang, et autres
Publié: (2025)

Chance constrained directional models in stochastic data envelopment analysis
par: Bolos, Vicente J., et autres
Publié: (2024)

Presolving and cutting planes for the generalized maximal covering location problem
par: Lv, Wei, et autres
Publié: (2024)

GFORS: GPU-Accelerated First-Order Method with Randomized Sampling for Binary Integer Programs
par: Wei, Ningji, et autres
Publié: (2025)

Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program
par: Xiaoyu, Luo, et autres
Publié: (2024)

An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
par: Guo, Yu-Qi, et autres
Publié: (2025)

An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
par: Chen, Wei-Kun, et autres
Publié: (2024)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
par: Zhang, Rui-Jin, et autres
Publié: (2025)

CatMADS: Mesh Adaptive Direct Search for constrained blackbox optimization with categorical variables
par: Audet, Charles, et autres
Publié: (2025)

High Probability Guarantees for Random Reshuffling
par: Yu, Hengxu, et autres
Publié: (2023)

A Gauge Set Framework for Flexible Robustness Design
par: Wei, Ningji, et autres
Publié: (2025)

Superadditivity-based valid inequalities and asymptotic bounds for the vehicle routing problem with stochastic demands
par: Legault, Robin, et autres
Publié: (2025)

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
par: Anstreicher, Kurt M., et autres
Publié: (2025)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
par: Guigues, Vincent, et autres
Publié: (2017)

An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem
par: Wang, Yan-Ru, et autres
Publié: (2025)

Random Reshuffling with Momentum for Nonconvex Problems: Iteration Complexity and Last Iterate Convergence
par: Qiu, Junwen, et autres
Publié: (2024)

Applying a Random-Key Optimizer on Mixed Integer Programs
par: Chaves, Antonio A., et autres
Publié: (2026)

Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
par: Burgard, Jan Pablo, et autres
Publié: (2024)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
par: Menickelly, Matt, et autres
Publié: (2023)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
par: Lapucci, Matteo, et autres
Publié: (2024)

Operation of an ambulance fleet under uncertainty
par: Guigues, Vincent, et autres
Publié: (2022)

An uncertainty model for positive-valued parameters with application to robust optimization
par: Tanaka, Tatsuya, et autres
Publié: (2026)

On feasibility cuts for chance-constrained multicommodity network design problems
par: Wouda, Niels A., et autres
Publié: (2024)

Nonlinear constrained optimization of Schur test functions
par: Anikushin, Mikhail, et autres
Publié: (2025)

A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization
par: Qiu, Junwen, et autres
Publié: (2023)

Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties
par: Thürauf, Johannes, et autres
Publié: (2024)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
par: Borges, Jennifer C., et autres
Publié: (2026)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
par: Kim, Junyoung, et autres
Publié: (2024)

An Exact Algorithm for Public Transport Line Planning Considering Passenger and Operational Costs and Lost Demand
par: Hansen, Siv Marie Cartland, et autres
Publié: (2026)

Augmentation approaches for Mixed Integer Programming
par: Puerto, Justo, et autres
Publié: (2025)

Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization
par: Audet, Charles, et autres
Publié: (2026)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
par: Mexi, Gioni, et autres
Publié: (2025)

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
par: Bomze, Immanuel, et autres
Publié: (2024)

An extension of an RLT-based solver to MINLP polynomial problems
par: González-Díaz, Julio, et autres
Publié: (2024)

A Safe Approximation Based on Mixed-Integer Optimization for Non-Convex Distributional Robustness Governed by Univariate Indicator Functions
par: Dienstbier, Jana, et autres
Publié: (2023)

Exact augmented Lagrangian duality for mixed integer convex optimization
par: Bhardwaj, Avinash, et autres
Publié: (2022)