The following pages link to Inmaculada Rodríguez-Martín (Q322619):
Displayed 24 items.
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
- Hierarchical survivable network design problems (Q325448) (← links)
- A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
- A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
- (Q1410619) (redirect page) (← links)
- Variable neighborhood tabu search and its application to the median cycle problem. (Q1410620) (← links)
- The periodic vehicle routing problem with driver consistency (Q1622811) (← links)
- The driver and vehicle routing problem (Q1651584) (← links)
- An exact algorithm for a vehicle-and-driver scheduling problem (Q1652246) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← links)
- An efficient multistart heuristic for the driver and vehicle routing problem (Q2108177) (← links)
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q2359136) (← links)
- Solving a capacitated hub location problem (Q2384615) (← links)
- The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic (Q3091523) (← links)
- Locating a cycle in a transportation or a telecommunications network (Q3593375) (← links)
- (Q4254943) (← links)
- The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293) (← links)
- The ring/<i>κ</i>‐rings network design problem: Model and branch‐and‐cut algorithm (Q4642409) (← links)
- A branch-and-cut algorithm for the plant-cycle location problem (Q4661044) (← links)
- (Q4955272) (← links)
- A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)