A Branch-and-Bound Method for the Fixed Charge Transportation Problem
From MaRDI portal
Recommendations
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem
- scientific article; zbMATH DE number 1330764
- Some branch-and-bound procedures for fixed-cost transportation problems
- scientific article; zbMATH DE number 3970518
- A branch-and-bound algorithm for solving fixed charge problems
Cited in
(47)- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- A set covering reformulation of the pure fixed charge transportation problem
- Some branch-and-bound procedures for fixed-cost transportation problems
- On the pure fixed charge transportation problem
- COLE: a new heuristic approach for fixed charge problem computational results
- Minimal-cost network flow problems with variable lower bounds on arc flows
- A branch-and-bound algorithm for solving fixed charge problems
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
- Algorithms for solving the single-sink fixed-charge transportation problem
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- An approach to solve a fuzzy bi-objective multi-index fixed charge transportation problem.
- Some transportation problems under uncertain environments
- Fractional polynomial bounds for the fixed charge problem
- Discontinuous piecewise linear optimization
- Fixed charge bulk transportation problem
- Multiperiod tool and production assignment in flexible manufacturing systems
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
- A tabu search heuristic procedure for the fixed charge transportation problem
- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
- A branch-cut-and-price algorithm for the piecewise linear transportation problem
- An equivalent path functional formulation of branched transportation problems
- Penalty computations for the set partitioning problem
- A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
- Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation
- A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
- On lower bounds for the fixed charge problem
- scientific article; zbMATH DE number 3898609 (Why is no real title available?)
- scientific article; zbMATH DE number 912072 (Why is no real title available?)
- Solving fixed charge transportation problem with interval parameters
- Integrated operating room scheduling and surgical instrument inventory management: models, algorithms, and cost-saving insights
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- A heuristic algorithm for the fixed charge problem
- An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem
- An algorithm for finding the optimum solution of solid fixed-charge transportation problem
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Bilinear modeling solution approach for fixed charge network flow problems
- Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- scientific article; zbMATH DE number 3970518 (Why is no real title available?)
- A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
- Solving fixed charge transportation problem with truck load constraint using metaheuristics
- On logarithmic fixed-charge transportation problem
- Stochastic optimization models for a single-sink transportation problem
- On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model
This page was built for publication: A Branch-and-Bound Method for the Fixed Charge Transportation Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5750718)
