Pages that link to "Item:Q1804365"
From MaRDI portal
The following pages link to A strongly polynomial algorithm for the transportation problem (Q1804365):
Displaying 32 items.
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- An iterative algorithm for two level hierarchical time minimization transportation problem (Q319851) (← links)
- Optimal radio resources and transmission formats assignment in OFDMA systems (Q336504) (← links)
- On the transportation problem with market choice (Q479018) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
- Bilevel time minimizing transportation problem (Q955331) (← links)
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485) (← links)
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (Q1072935) (← links)
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364) (← links)
- Ergonomic workplace design in the fast pick area (Q1642056) (← links)
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem (Q1652389) (← links)
- Scheduling last-mile deliveries with truck-based autonomous robots (Q1653394) (← links)
- First-order dominance: stronger characterization and a bivariate checking algorithm (Q1717226) (← links)
- Two level hierarchical time minimizing transportation problem (Q1769948) (← links)
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
- Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
- Uniform capacitated facility location problem with random input data (Q1948657) (← links)
- Rényi 100, quantitative and qualitative (in)dependence (Q2236653) (← links)
- Covering partially directed graphs with directed paths (Q2497477) (← links)
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs (Q2811304) (← links)
- (Q3081849) (← links)
- (Q3128904) (← links)
- POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS (Q3204329) (← links)
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources (Q4294732) (← links)
- BOUNDING WRONG‐WAY RISK IN CVA CALCULATION (Q4635042) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- A Solution Concept Related to “Bounded Rationality” for some Two-Echelon Models (Q5384715) (← links)
- (Q5856412) (← links)
- (Q5875370) (← links)
- Tropical medians by transportation (Q6126667) (← links)
- A solution technique for capacitated two-level hierarchical time minimization transportation problem (Q6164324) (← links)