Imagen de Portada

Asymptotics of solutions to the linear search problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Heinonen, Robin A.
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control Data Structures and Algorithms Probability
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Online Stochastic Packing with General Correlations
por: Cetin, Sabri, et al.
Publicado: (2025)

Availability is all you need: achieving optimal regret with minimal information for dynamic matching
por: Kerimov, Süleyman, et al.
Publicado: (2025)

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
por: Besbes, Omar, et al.
Publicado: (2022)

On Smale's 17th problem over the reals
por: Montanari, Andrea, et al.
Publicado: (2024)

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

SCaLE: Switching Cost aware Learning and Exploration
por: Bhuyan, Neelkamal, et al.
Publicado: (2026)

Active Learning for Non-Parametric Choice Models
por: Susan, Fransisca, et al.
Publicado: (2022)

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
por: Bhuyan, Neelkamal, et al.
Publicado: (2023)

Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming
por: Chen, Yilun, et al.
Publicado: (2025)

A uniformity principle for spatial matching
por: Ameen, Taha, et al.
Publicado: (2026)

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

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
por: Kasperski, Adam, et al.
Publicado: (2024)

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

Polynomial time algorithm for optimal stopping with fixed accuracy
por: Goldberg, David A., et al.
Publicado: (2018)

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

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

Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent
por: Altschuler, Jason M., et al.
Publicado: (2026)

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
por: Altschuler, Jason M., et al.
Publicado: (2023)

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

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
por: Cole, Richard, et al.
Publicado: (2023)

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
por: Alejandro-Soto, J. A., et al.
Publicado: (2025)

Interior point methods are not worse than Simplex
por: Allamigeon, Xavier, et al.
Publicado: (2022)

Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
por: Brubaker, Kyle, et al.
Publicado: (2025)

Semidefinite programming and linear equations vs. homomorphism problems
por: Ciardo, Lorenzo, et al.
Publicado: (2023)

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

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

Quantum speedups for linear programming via interior point methods
por: Apers, Simon, et al.
Publicado: (2023)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
por: Dvořák, Michal, et al.
Publicado: (2026)

Coordinating Spot and Contract Supply in Freight Marketplaces
por: Kaminsky, Philip, et al.
Publicado: (2026)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
por: Su, Yuexin, et al.
Publicado: (2026)

On the Complexity of Bilevel Independent Set Problem
por: Muluk, Komal
Publicado: (2026)

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

Improved Speed via Regional Fulfillment
por: Hathcock, Daniel, et al.
Publicado: (2026)

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
por: Segev, Danny
Publicado: (2026)

Circuit Diameter of Polyhedra is Strongly Polynomial
por: Natura, Bento
Publicado: (2026)

Approximation Schemes for Sequential Hiring Problems
por: Segev, Danny, et al.
Publicado: (2026)

Resource-Constrained Joint Replenishment via Power-of-$m^{1/k}$ Policies
por: Segev, Danny
Publicado: (2026)

Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
por: Segev, Danny
Publicado: (2026)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
por: Shen, Owen, et al.
Publicado: (2026)

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