Some branch-and-bound procedures for fixed-cost transportation problems
From MaRDI portal
Publication:3323706
Recommendations
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem
- scientific article; zbMATH DE number 3970518
- A branch-and-bound algorithm for solving fixed charge problems
- scientific article; zbMATH DE number 1330764
Cited in
(37)- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
- Facility location models for distribution planning
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Solving to optimality the uncapacitated fixed-charge network flow problem
- A branch and bound procedure for cost minimizing bulk transportation problem
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Penalty computations for the set partitioning problem
- A set covering reformulation of the pure fixed charge transportation problem
- A new node selection strategy in the branch-and-bound procedure
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
- A tabu search heuristic procedure for the fixed charge transportation problem
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- COLE: a new heuristic approach for fixed charge problem computational results
- Equivalent formulations for the branched transport and urban planning problems
- A branch-cut-and-price algorithm for the piecewise linear transportation problem
- A branch-and-bound algorithm for solving fixed charge problems
- 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 3970518 (Why is no real title available?)
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- scientific article; zbMATH DE number 912072 (Why is no real title available?)
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- A Lagrangian based branch-and-bound algorithm for production-transportation problems
- An equivalent path functional formulation of branched transportation problems
- Minimal-cost network flow problems with variable lower bounds on arc flows
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Complexity and approximation algorithms for fixed charge transportation problems
- Complexity and approximation algorithms for fixed charge transportation problems
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- Bilinear modeling solution approach for fixed charge network flow problems
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem
This page was built for publication: Some branch-and-bound procedures for fixed-cost transportation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3323706)
