Pages that link to "Item:Q422457"
From MaRDI portal
The following pages link to Algorithms for computing the optimal transitive approximation of a proximity relation (Q422457):
Displaying 6 items.
- Computing a T-transitive lower approximation or opening of a proximity relation (Q1038009) (← links)
- Minimizing cost travel in multimodal transport using advanced relation transitive closure (Q1738983) (← links)
- On best transitive approximations to simple graphs (Q1762840) (← links)
- A method for obtaining transitive approximations of a binary relation (Q2271873) (← links)
- New measures of proximity for the assignment algorithms in the MDVRPTW (Q5469660) (← links)
- Algorithms and Computation (Q5897872) (← links)