Pages that link to "Item:Q3725874"
From MaRDI portal
The following pages link to Generalized Subtour Elimination Constraints and Connectivity Constraints (Q3725874):
Displaying 12 items.
- The selective travelling salesman problem (Q910347) (← links)
- A framework for multi-robot node coverage in sensor networks (Q1022471) (← links)
- On symmetric subtour problems (Q1202764) (← links)
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem (Q1261382) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
- Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem (Q3088086) (← links)
- A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
- Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)
