Pages that link to "Item:Q786658"
From MaRDI portal
The following pages link to Guaranteed performance heuristics for the bottleneck traveling salesman problem (Q786658):
Displaying 25 items.
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph (Q293330) (← links)
- Performance guarantees for the TSP with a parameterized triangle inequality (Q294711) (← links)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (Q423908) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- Traveling salesman problem with clustering (Q616229) (← links)
- Optimization of decentralized multi-way join queries over pipelined filtering services (Q695027) (← links)
- Strong connectivity of sensor networks with double antennae (Q896697) (← links)
- An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes (Q908293) (← links)
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem (Q1079133) (← links)
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461) (← links)
- Traveling salesman problem under categorization (Q1200771) (← links)
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426) (← links)
- Minmax regret solutions for minimax optimization problems with uncertainty (Q1591541) (← links)
- Establishing symmetric connectivity in directional wireless sensor networks equipped with \(2\pi/3\) antennas (Q1679501) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem (Q1847357) (← links)
- Euclidean bottleneck bounded-degree spanning tree ratios (Q2066315) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- The complexity of symmetric connectivity in directional wireless sensor networks (Q2307492) (← links)
- Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae (Q2348034) (← links)
- Connectivity graphs of uncertainty regions (Q2408099) (← links)
- STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE (Q3166749) (← links)
- Algorithms for Euclidean Degree Bounded Spanning Tree Problems (Q5197492) (← links)
- Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas (Q6114860) (← links)
