Pages that link to "Item:Q2748381"
From MaRDI portal
The following pages link to A polynomial algorithm for a constrained traveling salesman problem (Q2748381):
Displaying 11 items.
- A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems (Q1090604) (← links)
- A strongly polynomial algorithm for the transportation problem (Q1804365) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← links)
- The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351) (← links)
- Traveling salesman-based curve reconstruction in polynomial time (Q2719129) (← links)
- Algorithmic aspects of pyramidal tours with restricted jump-backs (Q2780957) (← links)
- (Q3059494) (← links)
- (Q3115273) (← links)
- (Q3813626) (← links)
- (Q3832350) (← links)
- On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)