Pages that link to "Item:Q3783840"
From MaRDI portal
The following pages link to Transportation problems which can be solved by the use of hirsch-paths for the dual problems (Q3783840):
Displayed 8 items.
- Signature classes of transportation polytopes (Q689115) (← links)
- An infeasible (exterior point) simplex algorithm for assignment problems (Q811357) (← links)
- Sparse dual transportation polyhedra: Extreme points and signatures (Q911458) (← links)
- Worst case examples of an exterior point algorithm for the assignment problem (Q937404) (← links)
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints (Q962299) (← links)
- A strongly polynomial algorithm for the transportation problem (Q1804365) (← links)
- A relaxation column signature method for assignment problems (Q1814258) (← links)
- Utility/privacy trade-off as regularized optimal transport (Q6201932) (← links)