Pages that link to "Item:Q297085"
From MaRDI portal
The following pages link to A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies (Q297085):
Displayed 7 items.
- Bounds on the worst optimal value in interval linear programming (Q780105) (← links)
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem (Q1652389) (← links)
- A heuristic for obtaining better initial feasible solution to the transportation problem (Q2307995) (← links)
- Checking weak optimality and strong boundedness in interval linear programming (Q2317620) (← links)
- The outcome range problem in interval linear programming (Q2668598) (← links)
- An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions (Q5149536) (← links)
- Interval transportation problem: feasibility, optimality and the worst optimal value (Q6166938) (← links)