Pages that link to "Item:Q4838218"
From MaRDI portal
The following pages link to Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems (Q4838218):
Displaying 3 items.
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596) (← links)
- Polynomial algorithms for \(m\times (m+1)\) integer programs and \(m\times (m+k)\) diophantine systems (Q2265948) (← links)
- Discrete minimization with levels of claims (Q3835305) (← links)