Pages that link to "Item:Q3320127"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for solving fixed charge problems (Q3320127):
Displayed 16 items.
- Design and implementation of a decision support system for multistage investment in Chinese coal production and transportation (Q751492) (← links)
- 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 tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
- Hybrid extreme point tabu search (Q1609924) (← 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)
- 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)
- COAL: A new heuristic approach for solving the fixed charge problem - computational results (Q2277365) (← links)
- Tabu search applied to the general fixed charge problem (Q2367015) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
- An algorithm for solving fixed-charge problems using surrogate constraints (Q2638935) (← links)
- Formulation for a fixed-charge, separable nonlinear production planning problem (Q3339648) (← links)
- Solving large-scale mixed-integer programs with fixed charge variables (Q3680611) (← links)
- A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production (Q5202833) (← links)