Time-cost tradeoff in a three-dimensional assignment problem

DOI10.1016/0377-2217(89)90111-2zbMath0676.90044OpenAlexW1997253559MaRDI QIDQ1123126

S. H. Smith

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90111-2

zbMATH Keywords

three-dimensional assignmenttwo objective functions

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (4)

Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ On lexicographic optimal solutions in transportation problems ⋮ Bicriteria bottleneck linear programming problem ⋮ Time-cost Trade-off Relations in Bulk Transportation Problem

Cites Work

• Un algoritmo misto per il problema dell'assegnazione pluridimensionale
• The three dimensional bottleneck assignment problem and its variants
• An Algorithm for the Traveling Salesman Problem
• Letter to the Editor—The Multidimensional Assignment Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Time-cost tradeoff in a three-dimensional assignment problem