Pages that link to "Item:Q4199854"
From MaRDI portal
The following pages link to An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit (Q4199854):
Displayed 16 items.
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
- Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Worst-case analysis of two travelling salesman heuristics (Q786657) (← links)
- Partitioning heuristics for two geometric maximization problems (Q800827) (← links)
- On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097) (← links)
- Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486) (← links)
- Maximizing traveling salesman problem for special matrices (Q1343160) (← links)
- An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices (Q1602709) (← links)
- The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
- Facilities layout generalized model solved by n-boundary shortest path heuristics (Q1820668) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Finding maximum square-free 2-matchings in bipartite graphs (Q2498740) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- Algorithms – ESA 2004 (Q5464598) (← links)
- (Q5708503) (← links)