Pages that link to "Item:Q3008920"
From MaRDI portal
The following pages link to On minimum reload cost paths, tours, and flows (Q3008920):
Displaying 6 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- On minimum reload cost cycle cover (Q496639) (← links)
- An extended approach for lifting clique tree inequalities (Q498425) (← links)
- The minimum reload \(s-t\) path, trail and walk problems (Q987690) (← links)
- The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
- Constructing minimum changeover cost arborescenses in bounded treewidth graphs (Q5964020) (← links)
