Pages that link to "Item:Q4191881"

The following pages link to Approximation Algorithms for Some Postman Problems (Q4191881):

Displaying 48 items.

• Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
• Rural postman parameterized by the number of components of required edges (Q314816) (← links)
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
• An improved approximation algorithm for the clustered traveling salesman problem (Q456175) (← links)
• A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537) (← links)
• Heuristics for the rural postman problem (Q1046717) (← links)
• Designing networks with compact routing tables (Q1104109) (← links)
• On the windy postman problem on Eulerian graphs (Q1119487) (← links)
• An approximation algorithm for the general routing problem (Q1197996) (← links)
• On the mixed Chinese postman problem (Q1319678) (← links)
• Algorithms for the windy postman problem (Q1332802) (← links)
• A polyhedral approach to the rural postman problem (Q1342042) (← links)
• A heuristic algorithm based on Monte Carlo methods for the rural postman problem. (Q1406725) (← links)
• Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs (Q1652405) (← links)
• Min-max cover of a graph with a small number of parts (Q1751107) (← links)
• Capacitated arc routing problem with deadheading demands (Q1761173) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• An extension of Christofides heuristic to the k-person travelling salesman problem (Q1838426) (← links)
• A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
• A capacitated general routing problem on mixed networks (Q1894722) (← links)
• Algorithms for the Chinese postman problem on mixed networks (Q1894723) (← links)
• Algorithms for the rural postman problem (Q1906937) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
• Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
• A LP-based approximation algorithm for generalized traveling salesperson path problem (Q2150585) (← links)
• Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
• OAR lib: an open source arc routing library (Q2293658) (← links)
• New heuristic algorithms for the windy rural postman problem (Q2387296) (← links)
• A note on approximation algorithms of the clustered traveling salesman problem (Q2398506) (← links)
• The commodity-split multi-compartment capacitated arc routing problem (Q2664322) (← links)
• Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
• An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
• A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots (Q2802244) (← links)
• Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs (Q2958236) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• Efficient Algorithms for Eulerian Extension (Q3057616) (← links)
• From Few Components to an Eulerian Graph by Adding Arcs (Q3104786) (← links)
• Approximation Algorithms for the Single Robot Line Coverage Problem (Q3382005) (← links)
• A Decade of Capacitated Arc Routing (Q3564348) (← links)
• Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
• Eulerian location problems (Q4934874) (← links)
• Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
• On a routing and scheduling problem concerning multiple edge traversals in graphs (Q5318269) (← links)
• Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
• Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)
• Improving a constructive heuristic for the general routing problem (Q6179705) (← links)
• The single robot line coverage problem: Theory, algorithms, and experiments (Q6180033) (← links)