28 results on '"Pop, Petrică"'
Search Results
2. Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem
3. A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes
4. The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances
5. On the Resilience of an Ant-based System in Fuzzy Environments. An Empirical Study
6. The Generalized Traveling Salesman Problem solved with Ant Algorithms
7. Sensitive Ants for Denial Jamming Attack on Wireless Sensor Network
8. Classical hybrid approaches on a transportation problem with gas emissions constraints
9. An efficient solution approach for solving the two-stage supply chain problem with fixed costs associated to the routes
10. Sensor networks security based on sensitive robots agents. A conceptual model
11. Sensitive Ants in Solving the Generalized Vehicle Routing Problem
12. A two-level solution approach for solving the generalized minimum spanning tree problem
13. A novel two-level optimization approach for clustered vehicle routing problem
14. A Comprehensive Survey on the Generalized Traveling Salesman Problem
15. The generalized traveling salesman problem solved with ant algorithms
16. An improved hybrid ant-local search algorithm for the partition graph coloring problem
17. On the complexity of the selective graph coloring problem in some special classes of graphs
18. A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
19. A new relaxation method for the generalized minimum spanning tree problem
20. On the Selective Vehicle Routing Problem
21. An Efficient Hybrid Genetic Approach for Solving the Two-Stage Supply Chain Network Design Problem with Fixed Costs
22. A Parallel Algorithm for Solving a Two-Stage Fixed-Charge Transportation Problem
23. An efficient Reverse Distribution System for solving sustainable supply chain network design problem
24. New mathematical models of the generalized vehicle routing problem and extensions
25. Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem
26. Sensitive Ants in Solving the Generalized Vehicle Routing Problem.
27. A CUTTING PLANE APPROACH TO SOLVE THE RAILWAY TRAVELING SALESMAN PROBLEM.
28. A NOTE ON THE COMPLEXITY OF THE GENERALIZED MINIMUM SPANNING TREE PROBLEM.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.