Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
On the complexity of edge traversing
Journal of the ACM (JACM)
Communications of the ACM
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Optimal message routing without complete routing tables
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Finding Postal Carrier Walk Paths in Mixed Graphs
Computational Optimization and Applications
Approximation algorithms for the asymmetric postman problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
New heuristic algorithms for the windy rural postman problem
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Approximations for minimum and min-max vehicle routing problems
Journal of Algorithms
A deterministic tabu search algorithm for the capacitated arc routing problem
Computers and Operations Research
A Solution to the Rural Postman Problem Based on Artificial Ant Colonies
Current Topics in Artificial Intelligence
Rank-Based Ant System to Solve the Undirected Rural Postman Problem
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
Heuristics for the rural postman problem
Computers and Operations Research
A global repair operator for capacitated arc routing problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
New heuristic algorithms for the windy rural postman problem
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Approximations for minimum and min-max vehicle routing problems
Journal of Algorithms
Approximate mechanisms for the graphical TSP and other graph traversal problems
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Self-organizing feature maps to solve the undirected rural postman problem
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Efficient algorithms for Eulerian extension
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A Tabu Search Heuristic for the Prize-collecting Rural Postman Problem
Electronic Notes in Theoretical Computer Science (ENTCS)
Capacitated arc routing problem with deadheading demands
Computers and Operations Research
A new view on rural postman based on eulerian extension and matching
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
From few components to an eulerian graph by adding arcs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
On the mixed Chinese postman problem
Operations Research Letters
A new view on Rural Postman based on Eulerian Extension and Matching
Journal of Discrete Algorithms
New races in parameterized algorithmics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
An improved approximation algorithm for the clustered traveling salesman problem
Information Processing Letters
Reoptimizing the rural postman problem
Computers and Operations Research
GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem
Journal of Heuristics
| Hi-index | 0.01 |