Minimax under transportation constraints
From MaRDI portal
Publication:1297055
Recommendations
Cited in
(19)- Weighted graphs with fixed vertex degrees and network flows
- Open transportation models with a minimax criterion.
- Method of characteristic functions for classes of networks with fixed node degrees
- Closed transportation models with minimax criterion
- A triplanar transportation problem with a minimax criterion
- Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs
- Transport type multi-index minimax models and stream methods of their decision
- Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices
- Reshipments and overshipments in transportation problems with minimax objective
- Signatures of extremal 2-unifrom hypergraphs
- Minimax in transportation models with integral constraints. I
- Algorithm of multidimensional data transmission using extremal uniform hypergraphs
- A minimax criterion for incomplete bipartite transportation networks.
- Max-min sum minimization transportation problem
- scientific article; zbMATH DE number 2154257 (Why is no real title available?)
- Minimax in transportation models with integral constraints. II
- First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees
- scientific article; zbMATH DE number 810516 (Why is no real title available?)
- Hereditarily minimax matrices in models of transportation type
This page was built for publication: Minimax under transportation constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297055)