Pages that link to "Item:Q2892348"
From MaRDI portal
The following pages link to Computing with domino-parity inequalities for the traveling salesman problem (TSP) (Q2892348):
Displaying 5 items.
- The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
- Path planning on a cuboid using genetic algorithms (Q942312) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- Vehicle routing for milk collection with gradual blending: a case arising in Chile (Q2160533) (← links)
- Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem (Q3169103) (← links)