Efficiency and time-cost-tradeoffs in transportation problems

DOI10.1007/BF01782757zbMath0494.90051OpenAlexW1996469724MaRDI QIDQ1169400

Ulrich Derigs

Publication date: 1982

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01782757

zbMATH Keywords

efficiencytransportation problemssolution algorithmstime-cost-tradeoffs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

Unnamed Item ⋮ Total shipping cost/completion-date trade-off in transportation problem with additional restriction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reducibility of minimax to minisum 0-1 programming problems
• An augmenting path method for solving linear bottleneck transportation problems
• The Backboard Wiring Problem: A Placement Algorithm
• On three basic methods for solving bottleneck transportation problems
• Bicriteria Transportation Problem
• Nonlinear one-parametric linear programming and t-norm transportation problems
• Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
• Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
• Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem
• Lineare Programmierung und Erweiterungen
• Solving Bicriterion Mathematical Programs
• Problems and methods with multiple objective functions
• On some techniques useful for solution of transportation network problems
• The bottleneck transportation problem

This page was built for publication: Efficiency and time-cost-tradeoffs in transportation problems