A branch-and-bound algorithm for solving fixed charge problems
From MaRDI portal
Recommendations
- Some branch-and-bound procedures for fixed-cost transportation problems
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- Publication:3481490
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem
- A heuristic algorithm for the fixed charge problem
Cited in
(24)- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
- A revised bound improvement sequence algorithm
- A tabu search heuristic procedure for the fixed charge transportation problem
- Hybrid extreme point tabu search
- Solving fixed charge transportation problem with truck load constraint using metaheuristics
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
- A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
- Exact algorithm for solving a special fixed-charge linear programming problem
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
- Tabu search applied to the general fixed charge problem
- A heuristic algorithm for the fixed charge problem
- COLE: a new heuristic approach for fixed charge problem computational results
- An algorithm for solving fixed-charge problems using surrogate constraints
- Some branch-and-bound procedures for fixed-cost transportation problems
- Formulation for a fixed-charge, separable nonlinear production planning problem
- On lower bounds for the fixed charge problem
- scientific article; zbMATH DE number 4152149 (Why is no real title available?)
- Solving large-scale mixed-integer programs with fixed charge variables
- The interactive fixed charge linear programming problem
- A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production
- A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- Design and implementation of a decision support system for multistage investment in Chinese coal production and transportation
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem
This page was built for publication: A branch-and-bound algorithm for solving fixed charge problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320127)
