Pages that link to "Item:Q3735462"
From MaRDI portal
The following pages link to Decomposing the requirement space of a transporation problem into polyhedral cones (Q3735462):
Displaying 8 items.
- A decomposition formula of idempotent polyhedral cones based on idempotent superharmonic spaces (Q979686) (← links)
- Solving many linear programs that differ only in the right-hand side (Q1108193) (← links)
- Combinatoric classes of the transportation problem and their properties (Q1312755) (← links)
- Multiparametric demand transportation problem (Q1604061) (← links)
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
- Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function (Q1904656) (← links)
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
- Strongly polynomial algorithm for a production-transportation problem with concave production cost (Q3835663) (← links)