Pages that link to "Item:Q1924991"
From MaRDI portal
The following pages link to On the recognition of permuted Supnick and incomplete Monge matrices (Q1924991):
Displaying 7 items.
- On the traveling salesman problem with a relaxed Monge matrix (Q293365) (← links)
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
- Open shop scheduling with synchronization (Q1702656) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Estimation of Monge matrices (Q2203631) (← links)
- Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
