Pages that link to "Item:Q5580061"
From MaRDI portal
The following pages link to An approximative algorithm for the fixed charge problem (Q5580061):
Displayed 18 items.
- Fixed charge problems with identical fixed charges (Q797500) (← links)
- A vertex ranking algorithm for the fixed-charge transportation problem (Q1151821) (← links)
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem (Q1200636) (← links)
- Quasi-concave minimization subject to linear constraints (Q1215459) (← links)
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- Exact algorithm for solving a special fixed-charge linear programming problem (Q2277362) (← 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)
- A heuristic algorithm for the fixed charge problem (Q2430567) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
- (Q3478275) (← links)
- Degeneracy in fixed cost transportation problems (Q4060725) (← links)
- An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem (Q4764857) (← links)
- A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production (Q5202833) (← links)
- The fixed charge problem (Q5603733) (← links)
- The fractional fixed-charge problem (Q5648165) (← links)