An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems

DOI10.1287/OPRE.21.1.284MaRDI QIDQ5675147zbMATH OpenOpenAlexFDO

Authors

Publication date 1973

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.21.1.284

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10)

Cited in

(11)

• A branch and bound algorithm for the generalized assignment problem
• The generalized assignment problem: Valid inequalities and facets
• Pareto optimal solutions of a cost-time trade-off bulk transportation problem
• A study of the bottleneck single source transportation problem
• On a class of assignment problems.
• Minimization of makespan in generalized assignment problem.
• Lagrangean heuristics for location problems
• A Survey of the Generalized Assignment Problem and Its Applications
• An algorithm for the bottleneck generalized assignment problem
• Time-cost Trade-off Relations in Bulk Transportation Problem
• Application of optimization methods to the hematological support of patients with disseminated malignancies

This page was built for publication: An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems

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