An all Zero-One Algorithm for a Certain Class of Transportation Problems
From MaRDI portal
Publication:4401730
DOI10.1287/opre.19.6.1406zbMath0276.90037OpenAlexW1979872043MaRDI QIDQ4401730
Claudio Roveda, Adriano De Maio
Publication date: 1971
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.19.6.1406
Related Items
A study of the bottleneck single source transportation problem, A Lagrangian heuristic for the capacitated plant location problem with single source constraints, A Survey of the Generalized Assignment Problem and Its Applications, The equilibrium generalized assignment problem and genetic algorithm, Upper and lower bounds for the single source capacitated location problem., 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, Lagrangean/surrogate relaxation for generalized assignment problems, Time-cost Trade-off Relations in Bulk Transportation Problem, Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming, Relaxation heuristics for a generalized assignment problem, A class of greedy algorithms for the generalized assignment problem, A heuristic partitioning algorithm for a packaging problem
