On the history of the transportation and maximum flow problems
From MaRDI portal
Publication:5917415
DOI10.1007/s101070100259zbMath1030.90002OpenAlexW2141824346WikidataQ56018622 ScholiaQ56018622MaRDI QIDQ5917415
Publication date: 1 December 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/10084
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)
Related Items (26)
Reconstruction methods for networks: the case of economic and financial systems ⋮ Polynomial-time identification of robust network flows under uncertain arc failures ⋮ Trends in transportation and logistics ⋮ Vertex downgrading to minimize connectivity ⋮ A mathematical approach to emergent properties of metabolic networks: partial coupling relations, hyperarcs and flux ratios ⋮ Broadcasting in split graphs ⋮ Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms ⋮ An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems ⋮ Unnamed Item ⋮ Cooperative maximum-flow problem under uncertainty in logistic networks ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Transportation matrices with staircase patterns and majorization ⋮ The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability ⋮ Exact solution algorithms for the maximum flow problem with additional conflict constraints ⋮ Equilibrium strategies for multiple interdictors on a common network ⋮ Online facility assignment ⋮ On reworks in a serial process with flexible windows of time ⋮ Cooperative strategies for maximum-flow problem in uncertain decentralized systems using reliability analysis ⋮ Impact of compressor failures on gas transmission network capability ⋮ Dual representations for systemic risk measures ⋮ Traffic Networks and Flows over Time ⋮ On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows ⋮ Evolution of railway network flexibility: The Spanish broad gauge case ⋮ Risk-Averse Shortest Path Interdiction ⋮ Near-Optimal Distributed Maximum Flow ⋮ Reliability evaluation in terms of flow data mining for multistate networks
This page was built for publication: On the history of the transportation and maximum flow problems
