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

DOI10.1287/opre.21.1.284zbMath0259.90029OpenAlexW2096588035MaRDI QIDQ5675147

No author found.

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

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

Related Items

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