Pages that link to "Item:Q4261216"
From MaRDI portal
The following pages link to Capacity improvement, penalties, and the fixed charge transportation problem (Q4261216):
Displaying 12 items.
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem (Q915648) (← links)
- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge (Q1002061) (← links)
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
- A set covering reformulation of the pure fixed charge transportation problem (Q1317046) (← links)
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
- Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
- Algorithms for solving the single-sink fixed-charge transportation problem (Q2462557) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
- Some branch-and-bound procedures for fixed-cost transportation problems (Q3323706) (← links)
- Limitation and modification: On a cost pipeline trade-off in a transportation problem (Q4987707) (← links)
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem (Q5750718) (← links)
