Least d-Majorized Network Flows with Inventory and Statistical Applications

Cited in

(23)

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

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)