The following pages link to (Q3205014):
Displaying 8 items.
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
- Solving the linear matroid parity problem as a sequence of matroid intersection problems (Q1813836) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations (Q3911683) (← links)
- A restricted Lagrangean approach to the traveling salesman problem (Q3911684) (← links)
- Managing tendupatta leaf logistics: an integrated approach (Q4662766) (← links)