Pages that link to "Item:Q2778609"
From MaRDI portal
The following pages link to On a Class of Capacitated Transportation Problems (Q2778609):
Displaying 21 items.
- An iterative algorithm for two level hierarchical time minimization transportation problem (Q319851) (← links)
- A transportation planning problem with transfer costs in uncertain environment (Q781327) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- Blocking pairs of polyhedra arising from network flows (Q1221561) (← links)
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem (Q1652389) (← links)
- Multi-objective capacitated transportation problem with mixed constraint: a case study of certain and uncertain environment (Q1790407) (← links)
- Gainfree Leontief substitution flow problems (Q1802953) (← links)
- A Monge property for the \(d\)-dimensional transportation problem (Q1805449) (← links)
- Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities (Q2114885) (← links)
- Matching and scheduling of student-company-talks for a university it-speed dating event (Q2167666) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- Fuzzy programming with hyperbolic membership functions for multiobjective capacitated transportation problem. (Q2477120) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- Packing and covering with integral feasible flows in integral supply-demand networks (Q3790920) (← links)
- Solution of the Hitchcock problem with one single row capacity constraint per row by the Ford-Fulkerson method (Q3845819) (← links)
- An Operator Theory for a Class of Linear Fractional Programming Problems — I (Q4060760) (← links)
- A-stable block implicit methods containing second derivatives (Q4138040) (← links)
- Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)
- A bad network problem for the simplex method and other minimum cost flow algorithms (Q4775712) (← links)
- Network Flow Optimization with Minimum Quantities (Q5232831) (← links)
- The Fredholm radius of an operator in potential theory. [Continuation] (Q5522567) (← links)
