Solving Fully Neutrosophic Incompatible Multi-Item Fixed Charge Four-Dimensional Transportation Problem with Volume Constraints.
Chaitali KarMd Samim AktarManoranjan MaitiPritha DasPublished in: New Math. Nat. Comput. (2024)
Keyphrases
- fixed charge
- transportation problem
- multi item
- valid inequalities
- lot sizing
- network flow problem
- mixed integer
- integer program
- integer programming
- network design
- fixed cost
- traveling salesman problem
- lp relaxation
- column generation
- linear programming
- mixed integer programming
- cutting plane
- network design problem
- capacity expansion
- convex hull
- lower and upper bounds
- constraint programming
- feasible solution
- combinatorial optimization
- continuous variables
- multistage
- production cost
- constraint satisfaction