Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems

DOI10.1002/NAV.3800230402MaRDI QIDQ4149254zbMATH OpenOpenAlexFDO

Authors

Publication date 1976

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800230402

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cites work

• Alternate Formulations for Static Multi-Attribute Assignment Models
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
• Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design
• Time‐minimizing transportation problems

Cited in

(21)

• A study of the bottleneck single source transportation problem
• On the bottleneck linear programming problem
• Efficiency and time-cost-tradeoffs in transportation problems
• Linear lexicographic optimization
• An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems
• An augmenting path method for solving linear bottleneck assignment problems
• An augmenting path method for solving linear bottleneck transportation problems
• Constructing the set of efficient objective values in linear multiple objective transportation problems
• Extension of particle swarm optimization algorithm for solving two-level time minimization transportation problem
• The multiple bottleneck transportation problem
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• The multi-objective generalized consistent vehicle routing problem
• Outer branching: how to optimize under partial orders?
• Total shipping cost/completion-date trade-off in transportation problem with additional restriction
• Risk-control approach for bottleneck transportation problem with randomness and fuzziness
• Chance constrained bottleneck transportation problem with preference of routes
• Threshold robustness in discrete facility location problems: a bi-objective approach
• Eggshell breakage restricted bi-criteria eggs transportation problem
• Fair machine learning through constrained stochastic optimization and an -constraint method
• On trade-off solution pairs in a special type of transportation problem
• Network reoptimization procedures for multiobjective network problems

This page was built for publication: Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4149254)