The following pages link to (Q4744064):
Displayed 24 items.
- On approximating the minimum independent dominating set (Q750159) (← links)
- Combinatorial optimisation algorithms for a CAD workstation (Q750305) (← links)
- Worst-case analysis of two travelling salesman heuristics (Q786657) (← links)
- Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700) (← links)
- Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns (Q1014953) (← links)
- A stochastic dynamic traveling salesman problem with hard time windows (Q1042055) (← links)
- A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems (Q1080776) (← links)
- Heuristics for unequal weight delivery problems with a fixed error guarantee (Q1095815) (← links)
- Heuristics and bounds for the travelling salesman location problem on the plane (Q1099066) (← links)
- An approximation algorithm for the TSP (Q1119485) (← links)
- A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem (Q1130068) (← links)
- Worst case bounds for the Euclidean matching problem (Q1149255) (← links)
- On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162) (← links)
- Analysis of Christofides' heuristic: some paths are more difficult than cycles (Q1180833) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- Analysis of the Held-Karp lower bound for the asymmetric TSP (Q1200770) (← links)
- On the solutions of stochastic traveling salesman problems (Q1247370) (← links)
- Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation (Q1256860) (← links)
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514) (← links)
- Set-up saving schemes for printed circuit boards assembly (Q1309999) (← links)
- The travelling salesman problem with pick-up and delivery (Q1342068) (← links)
- Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem (Q2367039) (← links)
- A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)