Least d-Majorized Network Flows with Inventory and Statistical Applications
From MaRDI portal
Publication:5650191
DOI10.1287/mnsc.17.9.547zbMath0239.90014OpenAlexW2070911930MaRDI QIDQ5650191
Publication date: 1971
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.17.9.547
Related Items
Invariant \(K\)-minimal sets in the discrete and continuous settings, Strict positivity and D-majorization, Ergodicity of non-homogeneous \(\mathbf{p}\)-majorizing quadratic stochastic operators, Algorithms for separable convex optimization with linear ascending constraints, Majorization and divergence, The \(d\)-majorization polytope, On the congruence between consumer tastes and market prices, On a Reduction for a Class of Resource Allocation Problems, Taut-string solution of the equilibrium no-lag Clark-Scarf serial inventory problem, Relative submajorization and its use in quantum resource theories, A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems, Nested matrices and the existence of least majorized elements, Polymatroidal flow network models with multiple sinks, Cost allocation: The traveling salesman, bin packing, and the knapsack, The resource theory of informational nonequilibrium in thermodynamics, On generalized uniformly tapered matrices, On a class of least-element complementarity problems, Dimensionality reduction for a class of convex network flow problem, Iterative methods for linear complementarity problems with upperbounds on primary variables, A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory, Two constructive proofs on d-majorization and thermo-majorization, Decreasing minimization on base-polyhedra: relation between discrete and continuous cases, On solving convex optimization problems with linear ascending constraints
