Pages that link to "Item:Q1329798"
From MaRDI portal
The following pages link to Recognition of \(d\)-dimensional Monge arrays (Q1329798):
Displaying 11 items.
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- On Monge sequences in \(d\)-dimensional arrays (Q1375084) (← links)
- An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra. (Q1811083) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Estimation of Monge matrices (Q2203631) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
