惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

M
MIT News - Artificial intelligence
雷峰网
雷峰网
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Last Week in AI
Last Week in AI
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
阮一峰的网络日志
阮一峰的网络日志
月光博客
月光博客
博客园 - Franky
腾讯CDC
T
Tailwind CSS Blog
Recent Announcements
Recent Announcements
V
V2EX
N
Netflix TechBlog - Medium
量子位
Jina AI
Jina AI
Y
Y Combinator Blog
The GitHub Blog
The GitHub Blog
G
Google Developers Blog
爱范儿
爱范儿
博客园 - 叶小钗
D
Docker
MongoDB | Blog
MongoDB | Blog
D
DataBreaches.Net
T
The Blog of Author Tim Ferriss

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Sparse-dense flight copy-based interactive mechanism to a...
[Submitted on 17 Jun 2026] · 2026-06-18 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Flight recovery, aircraft rerouting, and passenger reallocation are critical in airline recovery. To preserve their interdependence that is neglected by the regular sequential recovery, we consider these recovery phases from an integration perspective. In addition, we incorporate cruise speed control to enhance the recovery performance. While using flight copies is a common modelling method in airline disruption management, the resulting integrated mathematical model is challenging to solve in real time due to the large number of flight copies, especially when considering cruise speed control. This paper introduces a new sparse-dense flight copy approach and proposes an innovative interactive mechanism that alternately adjusts aircraft routes on the sparse flight copy-based network and reallocates passenger itineraries on the dense flight copy-based network. Under the interactive mechanism, the involved sparse and dense networks are much smaller than those in the conventional flight copy approach. To implement such a mechanism, we develop an integrated flight, aircraft, and passenger recovery model (IFAPRM) and propose a customized Benders decomposition (CBD) to solve the model. Besides, we further propose some acceleration techniques to speed up the CBD method, including an effective feasibility certificate, scale management, and valid inequalities. Computational experiments on real-world data demonstrate that the sparse-dense flight copy-based interactive mechanism outperforms the conventional flight copy approach. In essence, the proposed interactive mechanism, along with its corresponding modelling method, algorithm, and acceleration techniques, provides a comprehensive methodology and a general decision-support framework for integrated rescheduling problems in complex operations, with potential applications in logistics, transportation, and beyond.

Submission history

From: Jiajin Lin [view email]
[v1] Wed, 17 Jun 2026 17:57:34 UTC (790 KB)