Pages that link to "Item:Q3735468"
From MaRDI portal
The following pages link to Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation (Q3735468):
Displaying 11 items.
- An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
- Penalty computations for the set partitioning problem (Q1309877) (← links)
- A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics (Q1823143) (← links)
- A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems (Q1823858) (← links)
- Exact algorithm for solving a special fixed-charge linear programming problem (Q2277362) (← links)
- Tabu search applied to the general fixed charge problem (Q2367015) (← 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)
- Capacity improvement, penalties, and the fixed charge transportation problem (Q4261216) (← links)
