Pages that link to "Item:Q2462557"
From MaRDI portal
The following pages link to Algorithms for solving the single-sink fixed-charge transportation problem (Q2462557):
Displayed 11 items.
- The bottleneck transportation problem with auxiliary resources (Q496104) (← links)
- Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem (Q835755) (← links)
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
- Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
- Fractional polynomial bounds for the fixed charge problem (Q2342141) (← links)
- Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach (Q2403107) (← links)
- An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions (Q5149536) (← links)
- Analysis of interval programming in different environments and its application to fixed-charge transportation problem (Q5367534) (← links)
- A novel reformulation for the single-sink fixed-charge transportation problem (Q6052058) (← links)