Copertina

Is Zadeh's Least-Entered Pivot Rule Exponential?

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Zadeh, Norman
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
di: Ene, Alina, et al.
Pubblicazione: (2025)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
di: Gao, Xuan-Zhao, et al.
Pubblicazione: (2024)

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

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

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

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

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

Deriving the Gradients of Some Popular Optimal Transport Algorithms
di: Xie, Fangzhou
Pubblicazione: (2025)

ALNS for Tugboat Scheduling in Inland Waterway
di: Ma, Zihang
Pubblicazione: (2025)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
di: Anapolska, Mariia, et al.
Pubblicazione: (2025)

Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
di: Objois, Étienne, et al.
Pubblicazione: (2025)

An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
di: Bhandari, Swastik
Pubblicazione: (2025)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
di: Segev, Danny, et al.
Pubblicazione: (2025)

Robust Gittins for Stochastic Scheduling
di: Moseley, Benjamin, et al.
Pubblicazione: (2025)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
di: Rohwedder, Lars, et al.
Pubblicazione: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
di: Encz, Koppány István, et al.
Pubblicazione: (2025)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
di: Blankenburg, Daniel, et al.
Pubblicazione: (2025)

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

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
di: Segev, Danny
Pubblicazione: (2025)

Bayesian Optimal Stopping with Maximum Value Knowledge
di: Kleer, Pieter, et al.
Pubblicazione: (2025)

Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization
di: Liu, Yang P., et al.
Pubblicazione: (2025)

Sum-Of-Squares To Approximate Knapsack
di: Kothari, Pravesh K., et al.
Pubblicazione: (2025)

Isotropic Noise in Stochastic and Quantum Convex Optimization
di: Marsden, Annie, et al.
Pubblicazione: (2025)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
di: Xu, Pan
Pubblicazione: (2025)

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

Quasi-Self-Concordant Optimization with Lewis Weights
di: Ene, Alina, et al.
Pubblicazione: (2025)

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

Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices
di: Vladu, Adrian
Pubblicazione: (2025)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
di: Chen, Li, et al.
Pubblicazione: (2025)

Assortment optimization given basket shopping behavior using the Ising model
di: Vasilyev, Andrey, et al.
Pubblicazione: (2025)

Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book
di: Bach, Eleon, et al.
Pubblicazione: (2025)

Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
di: Hu, Hins, et al.
Pubblicazione: (2025)

Reusing Samples in Variance Reduction
di: Jin, Yujia, et al.
Pubblicazione: (2025)

Near-Optimal Sample Complexity for MDPs via Anchoring
di: Lee, Jongmin, et al.
Pubblicazione: (2025)

Optimized methods for composite optimization: a reduction perspective
di: Bok, Jinho, et al.
Pubblicazione: (2025)

The Fair Periodic Assignment Problem
di: van Lieshout, Rolf, et al.
Pubblicazione: (2025)

Recent Advances in Maximum-Entropy Sampling
di: Fampa, Marcia, et al.
Pubblicazione: (2025)

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

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

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