Cover Image

A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xu, Xiaoyang, Ding, Hu
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms Artificial Intelligence Computational Geometry Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Survey on Algorithmic Developments in Optimal Transport Problem with Applications
by: Moradi, Sina
Published: (2025)

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems
by: Doerr, Benjamin, et al.
Published: (2026)

Algorithms for Standard-form ILP Problems via Komlós' Discrepancy Setting
by: Gribanov, Dmitry, et al.
Published: (2026)

A First Runtime Analysis of the NSGA-II on a Multimodal Problem
by: Doerr, Benjamin, et al.
Published: (2022)

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

Optimizing Line Segment Inspection with Limited-Range Drones
by: Díaz-Báñez, José-Miguel, et al.
Published: (2026)

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

A Tie-breaking based Local Search Algorithm for Stable Matching Problems
by: Qiu, Junyuan
Published: (2024)

Interior-point methods on manifolds: theory and applications
by: Hirai, Hiroshi, et al.
Published: (2023)

Timetable Nodes for Public Transport Network
by: Rohovyi, Andrii, et al.
Published: (2024)

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

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

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

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

Optimal Orthogonal Drawings in Linear Time
by: Didimo, Walter, et al.
Published: (2025)

A Primal-Dual Framework for Symmetric Cone Programming
by: Zheng, Jiaqi, et al.
Published: (2024)

The Robust Bilevel Selection Problem
by: Henke, Dorothee
Published: (2024)

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

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

A Control-Theoretic Perspective on Optimal High-Order Optimization
by: Lin, Tianyi, et al.
Published: (2019)

On the Complexity of Bilevel Independent Set Problem
by: Muluk, Komal
Published: (2026)

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

A Continuous-Time Perspective on Global Acceleration for Monotone Equation Problems
by: Lin, Tianyi, et al.
Published: (2022)

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

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

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

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

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

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

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

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

Convergence Analysis of Two-Layer Neural Networks under Gaussian Input Masking
by: Kolomvaki, Afroditi, et al.
Published: (2026)

Adaptive Frontier Exploration on Graphs with Applications to Network-Based Disease Testing
by: Choo, Davin, et al.
Published: (2025)

Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing
by: Li, Shuyao, et al.
Published: (2024)

Grams: Gradient Descent with Adaptive Momentum Scaling
by: Cao, Yang, et al.
Published: (2024)

A hierarchy of eigencomputations for polynomial optimization on the sphere
by: Lovitz, Benjamin, et al.
Published: (2023)

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

Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
by: Salem, Jad, et al.
Published: (2024)

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

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