Pages that link to "Item:Q1363755"
From MaRDI portal
The following pages link to Approximation algorithms for multi-index transportation problems with decomposable costs (Q1363755):
Displaying 10 items.
- The focus of attention problem (Q262243) (← links)
- Approximating the multi-level bottleneck assignment problem (Q453052) (← links)
- The approximability of three-dimensional assignment problems with bottleneck objective (Q845547) (← links)
- \(N\)-fold integer programming (Q951095) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Graphs of transportation polytopes (Q1040845) (← links)
- Solution of a multi-objective and multi-index real-life transportation problem using different fuzzy membership functions (Q2260696) (← links)
- Multi-index transport problems with decomposition structure (Q2261688) (← links)
- Polyhedral combinatorics of multi-index axial transportation problems (Q2482774) (← links)
- On multi-index assignment polytopes (Q2494661) (← links)
