Time-cost Trade-off Relations in Bulk Transportation Problem
From MaRDI portal
Recommendations
Cites work
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems
- An all Zero-One Algorithm for a Certain Class of Transportation Problems
- Bicriteria Transportation Problem
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Generalized Assignment with Nonlinear Capacity Interaction
- Modeling Facility Location Problems as Generalized Assignment Problems
- Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem
- Time-cost tradeoff in a three-dimensional assignment problem
Cited in
(8)- The optimization of transportation costs in logistics enterprises with time-window constraints
- Pareto optimal solutions of a cost-time trade-off bulk transportation problem
- scientific article; zbMATH DE number 4143774 (Why is no real title available?)
- scientific article; zbMATH DE number 550227 (Why is no real title available?)
- Cost-time trade-off in three-axial sums' transportation problem
- A cost and pipeline trade-off in a transportation problem
- Optimizing time–cost trade-off decisions in an interval transportation problem with multiple shipment options
- On trade-off solution pairs in a special type of transportation problem
This page was built for publication: Time-cost Trade-off Relations in Bulk Transportation Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4718636)
