The following pages link to (Q2935519):
Displayed 6 items.
- A minimum cost network flow model for the maximum covering and patrol routing problem (Q319918) (← links)
- Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem (Q2014365) (← links)
- Min-cost-flow preserving bijection between subgraphs and orientations (Q2111782) (← links)
- Data locality and replica aware virtual cluster embeddings (Q2405895) (← links)
- Characterization of random walks on space of unordered trees using efficient metric simulation (Q6069174) (← links)
- Mean‐standard deviation model for minimum cost flow problem (Q6179689) (← links)