Pages that link to "Item:Q915648"
From MaRDI portal
The following pages link to Use of penalties in a branch and bound procedure for the fixed charge transportation problem (Q915648):
Displaying 9 items.
- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge (Q1002061) (← links)
- Penalty computations for the set partitioning problem (Q1309877) (← links)
- A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
- A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
- Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← 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)
- Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem (Q2926472) (← links)
- An algorithm for finding the optimum solution of solid fixed-charge transportation problem (Q4764850) (← links)
