Pages that link to "Item:Q5917415"
From MaRDI portal
The following pages link to On the history of the transportation and maximum flow problems (Q5917415):
Displaying 26 items.
- Polynomial-time identification of robust network flows under uncertain arc failures (Q839810) (← links)
- A mathematical approach to emergent properties of metabolic networks: partial coupling relations, hyperarcs and flux ratios (Q890687) (← links)
- Cooperative maximum-flow problem under uncertainty in logistic networks (Q902866) (← links)
- Transportation matrices with staircase patterns and majorization (Q947648) (← links)
- Evolution of railway network flexibility: The Spanish broad gauge case (Q1025316) (← links)
- Reconstruction methods for networks: the case of economic and financial systems (Q1632525) (← links)
- Trends in transportation and logistics (Q1681388) (← links)
- Cooperative strategies for maximum-flow problem in uncertain decentralized systems using reliability analysis (Q1792823) (← links)
- Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
- Equilibrium strategies for multiple interdictors on a common network (Q2028891) (← links)
- On reworks in a serial process with flexible windows of time (Q2033394) (← links)
- Reliability evaluation in terms of flow data mining for multistate networks (Q2115808) (← links)
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321) (← links)
- Impact of compressor failures on gas transmission network capability (Q2295182) (← links)
- Dual representations for systemic risk measures (Q2299390) (← links)
- Risk-Averse Shortest Path Interdiction (Q2830955) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Traffic Networks and Flows over Time (Q3637317) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- (Q5002612) (← links)
- On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows (Q5124004) (← links)
- Online facility assignment (Q5919330) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- Two‐stage stochastic minimum <i>s</i> − <i>t</i> cut problems: Formulations, complexity and decomposition algorithms (Q6087397) (← links)
- An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (Q6087567) (← links)
- The Potts model with different piecewise constant representations and fast algorithms: a survey (Q6606497) (← links)
