Pages that link to "Item:Q2892348"

The following pages link to Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) (Q2892348):

Displaying 3 items.

• The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
• Path planning on a cuboid using genetic algorithms (Q942312) (← links)
• Vehicle routing for milk collection with gradual blending: a case arising in Chile (Q2160533) (← links)