Least d-Majorized Network Flows with Inventory and Statistical Applications

Cited in

(24)

Nested matrices and the existence of least majorized elements
On generalized uniformly tapered matrices
Algorithms for separable convex optimization with linear ascending constraints
On the congruence between consumer tastes and market prices
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
The d-majorization polytope
On solving convex optimization problems with linear ascending constraints
Invariant \(K\)-minimal sets in the discrete and continuous settings
Majorization and divergence
Relative submajorization and its use in quantum resource theories
A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory
Taut-string solution of the equilibrium no-lag Clark-Scarf serial inventory problem
Polymatroidal flow network models with multiple sinks
Dimensionality reduction for a class of convex network flow problem
On a class of least-element complementarity problems
A faster algorithm solving a generalization of isotonic median regression and a class of fused Lasso problems
Iterative methods for linear complementarity problems with upperbounds on primary variables
On a Reduction for a Class of Resource Allocation Problems
The resource theory of informational nonequilibrium in thermodynamics
Two constructive proofs on d-majorization and thermo-majorization
Strict positivity and D-majorization
Universality and classification of elementary thermal operations
Ergodicity of non-homogeneous \(\mathbf{p}\)-majorizing quadratic stochastic operators
Cost allocation: The traveling salesman, bin packing, and the knapsack

This page was built for publication: Least d-Majorized Network Flows with Inventory and Statistical Applications

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