Pages that link to "Item:Q2065792"

The following pages link to Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792):

Displaying 1 item.

• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)