Pages that link to "Item:Q686244"
From MaRDI portal
The following pages link to Monge and feasibility sequences in general flow problems (Q686244):
Displaying 8 items.
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- EMDUniFrac: exact linear time computation of the UniFrac metric and identification of differentially abundant organisms (Q1784414) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- On some properties of DNA graphs (Q1961230) (← links)
- Sparse Monge matrices arising from scheduling problems (Q2450613) (← links)
- Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem (Q4995102) (← links)
