Multistage transportation model and sufficient conditions for its potentiality

DOI10.1134/S1064562423600860MaRDI QIDQ6153312

A. V. Gasnikov, Unnamed Author, Unnamed Author, M. I. Persianov, Unnamed Author, Unnamed Author, Unnamed Author, M. B. Kubentaeva, Unnamed Author, Unnamed Author

Publication date: 19 March 2024

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

convex optimizationcombined modelnetwork equilibrium modelfour-stage approachstable dymanics model

Mathematics Subject Classification ID

Convex programming (90C25) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Cites Work

• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• Universal gradient methods for convex optimization problems
• Universal method for stochastic composite optimization problems
• Mathematical modeling of traffic flows
• A stable alternative to Sinkhorn's algorithm for regularized optimal transport
• Evolutionary interpretations of entropy model for correspondence matrix calculation
• Primal–dual accelerated gradient methods with small-dimensional relaxation oracle
• On the three-stage version of stable dynamic model
• Universal intermediate gradient method for convex problems with inexact oracle

This page was built for publication: Multistage transportation model and sufficient conditions for its potentiality