The Multi-Index Problem
From MaRDI portal
Publication:5732209
DOI10.1287/opre.11.3.368zbMath0121.14604MaRDI QIDQ5732209
Publication date: 1963
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.11.3.368
Related Items
Construction and algebraic characterizations of a planar four-index transportation problem equivalent to a circularization network flow problem, Unnamed Item, Multiple objective decision-making in the mode choice problem: A goal-programming approach, Unnamed Item, Zurückführung des Stundenplanproblems auf ein dreidimensionales Transportproblem, A survey of dynamic network flows, An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm, Conditions for the existence of solutions of the three-dimensional planar transportation problem, Numerische Erfahrungen bei der Lösung des dreidimensionalen Transportproblems, Construction and algebraic characterizations of the planar and axial transportation problems, Approximation algorithms for multi-dimensional assignment problems with decomposable costs, An algorithm for the planar three-index assignment problem, Approximation algorithms for multi-index transportation problems with decomposable costs, Solving fuzzy solid transportation problems by an evolutionary algorithm based parametric approach, Facets of the three-index assignment polytope, On representatives of multi-index transportation problems, Polyhedral combinatorics of multi-index axial transportation problems, Fuzzy total transportation cost measures for fuzzy solid transportation problem, Ein Verfahren zum Erkennen von Transportproblemen aus der Simplexmatrix, An axial four-index transportation problem and its algebraic characterizations, Planar three-index transportation problems with dominating index, Multi-Index Transportation Problem with mixed type of Axial Constraints, An algorithm for the optimum time-cost trade-off in three dimensional transportation problem
