Imagen de Portada

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kasperski, Adam, Zielinski, Pawel
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Approximating the shortest path problem with scenarios
por: Kasperski, Adam, et al.
Publicado: (2018)

Recoverable robust shortest path problem under interval budgeted uncertainty representations
por: Jackiewicz, Marcel, et al.
Publicado: (2024)

Centrality of shortest paths: Algorithms and complexity results
por: Phosavanh, Johnson, et al.
Publicado: (2024)

On the complexity of the upgrading version of the maximal covering location problem
por: Baldomero-Naranjo, Marta, et al.
Publicado: (2024)

Handicap reduction for linear complementarity problems
por: -Nagy, Marianna E., et al.
Publicado: (2026)

A note on the complexity of the picker routing problem in multi-block warehouses and related problems
por: Prunet, Thibault, et al.
Publicado: (2023)

A rounding and clustering-based exact algorithm for the p-center problem
por: Ales, Zacharie, et al.
Publicado: (2024)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
por: Sergeev, Ivan
Publicado: (2024)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
por: Chang, Claire, et al.
Publicado: (2026)

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
por: Yamanaka, Toshiaki
Publicado: (2025)

Parameterized algorithms for block-structured integer programs with large entries
por: Cslovjecsek, Jana, et al.
Publicado: (2023)

Asymptotics of solutions to the linear search problem
por: Heinonen, Robin A.
Publicado: (2026)

A quantum central path algorithm for linear optimization
por: Augustino, Brandon, et al.
Publicado: (2023)

The matrix-vector complexity of $Ax=b$
por: Dereziński, Michał, et al.
Publicado: (2026)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
por: Chen, Yike, et al.
Publicado: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
por: Shi, Haoyan, et al.
Publicado: (2024)

Distributionally Robust Newsvendor on a Metric
por: Foussoul, Ayoub, et al.
Publicado: (2024)

The Robust Bilevel Selection Problem
por: Henke, Dorothee
Publicado: (2024)

Extracting Dual Solutions via Primal Optimizers
por: Carmon, Yair, et al.
Publicado: (2024)

Accelerating Proximal Gradient Descent via Silver Stepsizes
por: Bok, Jinho, et al.
Publicado: (2024)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
por: Adil, Deeksha, et al.
Publicado: (2024)

Convex optimization with $p$-norm oracles
por: Adil, Deeksha, et al.
Publicado: (2024)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
por: Zhang, Qiao, et al.
Publicado: (2024)

Fully Subexponential Time Approximation Scheme for Product Partition
por: Costandin, Marius
Publicado: (2024)

Optimization in Sanger Sequencing
por: Carpente, Luisa, et al.
Publicado: (2024)

Strongly Polynomial Frame Scaling to High Precision
por: Dadush, Daniel, et al.
Publicado: (2024)

Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
por: Altschuler, Jason M., et al.
Publicado: (2024)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
por: Sun, Shuo, et al.
Publicado: (2024)

On computing approximate Lewis weights
por: Apers, Simon, et al.
Publicado: (2024)

Online Matching on $3$-Uniform Hypergraphs
por: Borst, Sander, et al.
Publicado: (2024)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
por: Segev, Danny
Publicado: (2024)

Improved Approximation Guarantees for Joint Replenishment in Continuous Time
por: Segev, Danny
Publicado: (2024)

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
por: Nerem, Robert R., et al.
Publicado: (2024)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
por: Housni, Omar El, et al.
Publicado: (2024)

A Decomposition Theorem for Dynamic Flows
por: Graf, Lukas, et al.
Publicado: (2024)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
por: Moeini, Mahdi, et al.
Publicado: (2024)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
por: Hunkenschröder, Christoph, et al.
Publicado: (2025)

Generalized Assignment and Knapsack Problems in the Random-Order Model
por: Klimm, Max, et al.
Publicado: (2025)

Radial Isotropic Position via an Implicit Newton's Method
por: Jambulapati, Arun, et al.
Publicado: (2025)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
por: Adil, Deeksha, et al.
Publicado: (2025)