Pages that link to "Item:Q2267294"
From MaRDI portal
The following pages link to Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294):
Displaying 17 items.
- On lower bounds for the fixed charge problem (Q337190) (← links)
- A set covering reformulation of the pure fixed charge transportation problem (Q1317046) (← links)
- A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← 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)
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics (Q1823143) (← links)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
- Solving the facility location and fixed charge solid transportation problem (Q1983711) (← links)
- COAL: A new heuristic approach for solving the fixed charge problem - computational results (Q2277365) (← links)
- Fractional polynomial bounds for the fixed charge problem (Q2342141) (← links)
- Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach (Q2403107) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
- A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem (Q2942705) (← links)
- Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems (Q3984310) (← links)
- Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
- Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)
- A sequential reduction algorithm for the large-scale fixed-charge network flow problems (Q6542455) (← links)
