A new approach for solving multi-commodity and bounded network transportation problem
From MaRDI portal
Publication:5037367
DOI10.22055/JAMM.2021.37258.1926zbMATH Open1483.90029OpenAlexW3199381572MaRDI QIDQ5037367FDOQ5037367
Hadi Basirzadeh, Milad Habibinia
Publication date: 28 February 2022
Full work available at URL: https://jamm.scu.ac.ir/article_16994_c8fe443eb18a756b2b90ac5afdc89fa6.pdf
Recommendations
- Iterative functional modification method for solving a transportation problem
- Preface: Special issue on network optimization in transportation, logistics, and industry
- Computer Algebra and Geometric Algebra with Applications
- A branch and bound procedure for cost minimizing bulk transportation problem
- scientific article; zbMATH DE number 3922335
Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cited In (6)
- A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A hybrid simulated annealing algorithm to estimate a better upper bound of the minimal total cost of a transportation problem with varying demands and supplies
- Algorithms and Computation
- A two-stage data envelopment analysis approach to solve extended transportation problem with non-homogenous costs
This page was built for publication: A new approach for solving multi-commodity and bounded network transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037367)
