Pages that link to "Item:Q1396922"
From MaRDI portal
The following pages link to On dual minimum cost flow algorithms (Q1396922):
Displayed 11 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
- Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← links)
- Problems of synthesis of connected networks with respect to isomorphic subgraphs (Q2574245) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees (Q3100698) (← links)
- Smoothed Analysis of the Successive Shortest Path Algorithm (Q3457194) (← links)
- Efficient algorithms for the reverse shortest path problem on trees under the hamming distance (Q4987673) (← links)
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms (Q4987701) (← links)
- The blocking job shop with rail-bound transportation (Q5963615) (← links)
- Robust Algorithms for TSP and Steiner Tree (Q6075747) (← links)