237 results on '"Eduardo Uchoa"'
Search Results
2. VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem.
3. Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems.
4. Solving vehicle routing problems with intermediate stops using VRPSolver models.
5. A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem.
6. Special Section on "DIMACS Implementation Challenge: Vehicle Routing" and "The EURO Meets NeurIPS 2022 Vehicle Routing Competition".
7. Solving real urban VRPTW instances by applying a Branch-Cut-and-Price via VRPsolver.
8. Branch-cut-and-price algorithms for two routing problems with hotel selection.
9. A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery.
10. On the Multiple Steiner Traveling Salesman Problem with Order Constraints.
11. A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing.
12. Cover by disjoint cliques cuts for the knapsack problem with conflicting items.
13. A unified exact approach for Clustered and Generalized Vehicle Routing Problems.
14. A Generic Exact Solver for Vehicle Routing and Related Problems.
15. A layered compact formulation for the Multiple Steiner TSP with Order constraints.
16. The Multiple Steiner TSP with order constraints: complexity and optimization algorithms.
17. On the exact solution of vehicle routing problems with backhauls.
18. A generic exact solver for vehicle routing and related problems.
19. On the exact solution of a large class of parallel machine scheduling problems.
20. Solving Bin Packing Problems Using VRPSolver Models.
21. Distance Transformation for Network Design Problems.
22. Improved state space relaxation for constrained two-dimensional guillotine cutting problems.
23. Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm.
24. Primal Heuristics for Branch and Price: The Assets of Diving Methods.
25. A robust and scalable algorithm for the Steiner problem in graphs.
26. Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems.
27. On the complete set packing and set partitioning polytopes: Properties and rank 1 facets.
28. A branch-and-price algorithm for the Minimum Latency Problem.
29. Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation.
30. Improved branch-cut-and-price for capacitated vehicle routing.
31. New benchmark instances for the Capacitated Vehicle Routing Problem.
32. Limited memory Rank-1 Cuts for Vehicle Routing Problems.
33. New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows.
34. A POPMUSIC matheuristic for the capacitated vehicle routing problem.
35. Unsplittable non-additive capacitated network design using set functions polyhedra.
36. Column generation approaches for the software clustering problem.
37. Improved Branch-Cut-and-Price for Capacitated Vehicle Routing.
38. In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.
39. Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem.
40. Fast Local Search for Steiner Trees in Graphs.
41. The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm.
42. New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery.
43. The Team Orienteering Problem: Formulations and Branch-Cut and Price.
44. Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut.
45. A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection.
46. A Distributed Primal-Dual Heuristic for Steiner Problems in Networks.
47. A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem.
48. Column Generation Based Heuristic for a Helicopter Routing Problem.
49. Two-phase optimization approach for maintenance workforce planning in power distribution utilities
50. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing 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.