Pages that link to "Item:Q2396369"
From MaRDI portal
The following pages link to An exact algorithm with linear complexity for a problem of visiting megalopolises (Q2396369):
Displayed 6 items.
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- The reduction of the Pareto set of a special structure in bicriteria discrete problems (Q5100140) (← links)
- OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS (Q5125218) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane (Q6130875) (← links)