:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Díaz-García, José A., Caro-Lopra, Francisco J.
Format:	Preprint
Published:	2025
Subjects:	Probability 90C05, 90C15, 90B36
Online Access:	https://arxiv.org/abs/2511.06556
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Achieving $\tilde{\mathcal{O}}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation
by: Yan, Chen, et al.
Published: (2024)

Multi-objective stochastic linear programming with recourse and flexible decision making
by: Hamel, Andreas H., et al.
Published: (2024)

Chance constrained directional models in stochastic data envelopment analysis
by: Bolos, Vicente J., et al.
Published: (2024)

A simulation-optimization approach for fractional, profitability-oriented inventory control under service-level type constraints
by: Sun, Tianxiao, et al.
Published: (2026)

Multivariate approximation by polynomial and generalised rational functions
by: Millán, R. Díaz, et al.
Published: (2021)

Bayesian Multi-Topology Express Transportation Network Design under Posterior Predictive Demand, Sorting-Efficiency and Delivery-Time Uncertainty
by: Chatterjee, Debashis
Published: (2026)

Multi-Action Restless Bandits with Weakly Coupled Constraints: Simultaneous Learning and Control
by: Fu, Jing, et al.
Published: (2024)

A belief-state restless bandit model for treatment adherence: Whittle indexability via partial conservation laws
by: Niño-Mora, José, et al.
Published: (2026)

Random intersection graphs with communities
by: van der Hofstad, Remco, et al.
Published: (2018)

Markovian restless bandits and index policies: A review
by: Niño-Mora, José
Published: (2026)

Stochastic dynamic programming with non-linear discounting
by: Bäuerle, Nicole, et al.
Published: (2020)

Multi-gear bandits, partial conservation laws, and indexability
by: Niño-Mora, José
Published: (2026)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
by: Kim, Junyoung, et al.
Published: (2024)

Critical first passage percolation on random graphs
by: Bhamidi, Shankar, et al.
Published: (2024)

A fast-pivoting algorithm for Whittle's restless bandit index
by: Niño-Mora, José
Published: (2026)

Age of information cost minimization with no buffers, random arrivals and unreliable channels: A PCL-indexability analysis
by: Niño-Mora, José
Published: (2026)

A Generalized Version of Chung's Lemma and its Applications
by: Jiang, Li, et al.
Published: (2024)

Implementing a unified solver for nonlinearly constrained optimization
by: Vanaret, Charlie, et al.
Published: (2024)

The phase transition in bounded-size Achlioptas processes
by: Riordan, Oliver, et al.
Published: (2017)

Persistent hubs in CMJ branching processes with independent increments and preferential attachment trees
by: Iyer, Tejas
Published: (2024)

On a sufficient condition for explosion in CMJ branching processes and applications to recursive trees
by: Iyer, Tejas
Published: (2023)

Stochastic Gradient Descent Revisited
by: Louzi, Azar
Published: (2024)

Traces left by random walks on large random graphs: local limits
by: Dereich, Steffen
Published: (2024)

IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
by: Cameron, Thomas R., et al.
Published: (2025)

Structural and Solution Analysis for the Ordered Weber Problem under Spatial Uncertainty
by: Blanco, Víctor, et al.
Published: (2025)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, et al.
Published: (2024)

Simulation-Optimization Approaches for the Network Immunization Problem with Quarantining
by: Hoogervorst, Rowan, et al.
Published: (2024)

A Fisher-Rao gradient flow for entropy-regularised Markov decision processes in Polish spaces
by: Kerimkulov, Bekzhan, et al.
Published: (2023)

On feasibility cuts for chance-constrained multicommodity network design problems
by: Wouda, Niels A., et al.
Published: (2024)

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
by: Tanaka, Masato, et al.
Published: (2021)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
by: Barkel, Mathijs, et al.
Published: (2026)

Splitting Algorithms for Distributionally Robust Optimization
by: Briceño-Arias, Luis, et al.
Published: (2024)

Competing types in preferential attachment graphs with community structure
by: Haslegrave, John, et al.
Published: (2022)

Complexity of an inexact stochastic SQP algorithm for equality constrained optimization
by: O'Neill, Michael J., et al.
Published: (2026)

Degrees in random $m$-ary hooking networks
by: Bhutani, Kiran R., et al.
Published: (2023)

Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees
by: Lu, Zhaosong, et al.
Published: (2024)

Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks
by: Dijkstra, Lukas, et al.
Published: (2024)

A model-free approach for solving choice-based competitive facility location problems using simulation and submodularity
by: Legault, Robin, et al.
Published: (2022)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
by: Zhang, Rui-Jin, et al.
Published: (2025)

A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
by: Qiu, Songqiang, et al.
Published: (2023)