A Faster Parametric Search for the Integral Quickest Transshipment Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Anapolska, Mariia, Boom, Dario van den, Büsing, Christina, Gersing, Timo
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

Interval-Constrained Bipartite Matching over Time
di: Abels, Andreas, et al.
Pubblicazione: (2024)

Minimum-Peak-Cost Flows Over Time
di: Anapolska, Mariia, et al.
Pubblicazione: (2025)

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

Entropy Regularization and Faster Decremental Matching in General Graphs
di: Chen, Jiale, et al.
Pubblicazione: (2023)

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

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

The Robust Bilevel Selection Problem
di: Henke, Dorothee
Pubblicazione: (2024)

On the Complexity of Bilevel Independent Set Problem
di: Muluk, Komal
Pubblicazione: (2026)

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

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

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)

Solving the Probabilistic Profitable Tour Problem on a Tree
di: Angelelli, Enrico, et al.
Pubblicazione: (2022)

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

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

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

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

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

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
di: Kuhlmann, Stefan, et al.
Pubblicazione: (2025)

Recursive Modified Pattern Search on High-dimensional Simplex : A Blackbox Optimization Technique
di: Das, Priyam
Pubblicazione: (2016)

Safe Sequences via Dominators in DAGs for Path-Covering Problems
di: Sena, Francisco, et al.
Pubblicazione: (2024)

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

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

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

A nearly optimal randomized algorithm for explorable heap selection
di: Borst, Sander, et al.
Pubblicazione: (2022)

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

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

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

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

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)

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)

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)

Is Zadeh's Least-Entered Pivot Rule Exponential?
di: Zadeh, Norman
Pubblicazione: (2025)