Pages that link to "Item:Q1151821"
From MaRDI portal
The following pages link to A vertex ranking algorithm for the fixed-charge transportation problem (Q1151821):
Displaying 9 items.
- On lower bounds for the fixed charge problem (Q337190) (← links)
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria (Q460659) (← links)
- Maximizing strictly convex quadratic functions with bounded perturbations (Q639197) (← links)
- Heuristic algorithms for the fixed-charge transportation problem (Q998695) (← links)
- Solving fixed charge transportation problem with interval parameters (Q1791478) (← links)
- Fractional polynomial bounds for the fixed charge problem (Q2342141) (← links)
- A heuristic algorithm for the fixed charge problem (Q2430567) (← links)
- An algorithm for finding the optimum solution of solid fixed-charge transportation problem (Q4764850) (← links)
- An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem (Q4764857) (← links)
