Time-cost Trade-off Relations in Bulk Transportation Problem

DOI10.1080/02522667.1995.10699230zbMath0861.90099OpenAlexW2080547115MaRDI QIDQ4718636

Vanita Verma, Anju Gupta, Munish C. Puri

Publication date: 8 December 1996

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1995.10699230

zbMATH Keywords

decision supportbicriteria bulk transportation

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Time-cost tradeoff in a three-dimensional assignment problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Generalized Assignment with Nonlinear Capacity Interaction
• Bicriteria Transportation Problem
• Modeling Facility Location Problems as Generalized Assignment Problems
• Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem
• An all Zero-One Algorithm for a Certain Class of Transportation Problems
• Direct Search Algorithms for Zero-One and Mixed-Integer Programming
• An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems

This page was built for publication: Time-cost Trade-off Relations in Bulk Transportation Problem