Universally maximum flow with piecewise-constant capacities (Q2764994): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.1030
@@ Property / full work available at URL: https://doi.org/10.1002/net.1030 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2004700840
@@ Property / OpenAlex ID: W2004700840 / rank @@
+Normal rank
@@ Property / cites work @@
+A Class of Continuous Network Flow Problems
@@ Property / cites work: A Class of Continuous Network Flow Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A continuous-time network simplex algorithm
@@ Property / cites work: A continuous-time network simplex algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of dynamic network flows
@@ Property / cites work: A survey of dynamic network flows / rank @@
+Normal rank
@@ Property / cites work @@
+The quickest flow problem
@@ Property / cites work: The quickest flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algorithms for the Quickest Transshipment Problem
+Normal rank
@@ Property / cites work @@
+Efficient continuous-time dynamic network flow algorithms
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the generalized parametric minimum cut problem and applications
+Normal rank
@@ Property / cites work @@
+Optimal dynamic routing in communication networks with continuous traffic
+Normal rank
@@ Property / cites work @@
+Q3128904
@@ Property / cites work: Q3128904 / rank @@
+Normal rank
@@ Property / cites work @@
+The Quickest Transshipment Problem
@@ Property / cites work: The Quickest Transshipment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
+Normal rank
@@ Property / cites work @@
+Maximal, Lexicographic, and Dynamic Network Flows
@@ Property / cites work: Maximal, Lexicographic, and Dynamic Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal control approach to dynamic routing in networks
+Normal rank
@@ Property / cites work @@
+Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
+Normal rank
@@ Property / cites work @@
+Maximum-throughput dynamic network flows
@@ Property / cites work: Maximum-throughput dynamic network flows / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Convex Cost Dynamic Network Flows
@@ Property / cites work: Minimum Convex Cost Dynamic Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Continuous-Time Flows in Networks
@@ Property / cites work: Continuous-Time Flows in Networks / rank @@
+Normal rank
@@ Property / cites work @@
+An adaptive discretization algorithm for a class of continuous network programs
+Normal rank
@@ Property / cites work @@
+An Algorithm for a Class of Continuous Linear Programs
+Normal rank
@@ Property / cites work @@
+A Study of General Dynamic Network Programs with Arc Time-Delays
+Normal rank
@@ Property / cites work @@
+Optimal Congestion Control in Single Destination Networks
+Normal rank
@@ Property / cites work @@
+An Algorithm for Universal Maximal Dynamic Flows in a Network
+Normal rank